A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Verifiable Random Functions from Identity-Based Key Encapsulation
[chapter]
2009
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-01001-9_32
fatcat:gr7ftwcwibcwphhml3rvas5qce