Verifiable Random Functions from Identity based Key Encapsulation

Abstract : We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-KEM is VRF suitable if it provides what we call unique decryption (i.e. given a ciphertext C produced with respect to an identity ID , all the secret keys corresponding to identity ID′ , decrypt to the same value, even if ID≠ID′ ) and it satisfies an additional property that we call pseudorandom decapsulation. In a nutshell, pseudorandom decapsulation means that if one decrypts a ciphertext C, produced with respect to an identity ID , using the decryption key corresponding to any other identity ID′ the resulting value looks random to a polynomially bounded observer. Interestingly, we show that most known IB-KEMs already achieve pseudorandom decapsulation. Our construction is of interest both from a theoretical and a practical perspective. Indeed, apart from establishing a connection between two seemingly unrelated primitives, our methodology is direct in the sense that, in contrast to most previous constructions, it avoids the inefficient Goldreich-Levin hardcore bit transformation.
Type de document :
Communication dans un congrès
Antoine Joux. EUROCRYPT 2009, Apr 2009, Cologne, Germany. 5479, pp.554-571, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-01001-9_32〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00915859
Contributeur : Michel Abdalla <>
Soumis le : lundi 9 décembre 2013 - 14:04:27
Dernière modification le : jeudi 11 janvier 2018 - 06:22:10

Identifiants

Collections

Citation

Michel Abdalla, Dario Catalano, Dario Fiore. Verifiable Random Functions from Identity based Key Encapsulation. Antoine Joux. EUROCRYPT 2009, Apr 2009, Cologne, Germany. 5479, pp.554-571, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-01001-9_32〉. 〈hal-00915859〉

Partager

Métriques

Consultations de la notice

169