Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Michel Abdalla Connect in order to contact the contributor
Submitted on : Monday, December 9, 2013 - 2:04:27 PM
Last modification on : Thursday, March 17, 2022 - 10:08:35 AM

Links full text




Michel Abdalla, Dario Catalano, Dario Fiore. Verifiable Random Functions from Identity based Key Encapsulation. EUROCRYPT 2009, Apr 2009, Cologne, Germany. pp.554-571, ⟨10.1007/978-3-642-01001-9_32⟩. ⟨hal-00915859⟩



Record views