Publication: Verifiable Random Functions
Open/View Files
Date
1999
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE Computer Society Press
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Micali, Silvio, Michael Rabin, and Salil Vadhan. 1999. Verifiable random functions. In Proceedings of the 40th Annual Symposium on the Foundations of Computer Science (FOCS `99), 120-130. New York: IEEE Computer Society Press.
Research Data
Abstract
We efficiently combine unpredictability and verifiability by extending the Goldreich-Goldwasser-Micali notion of pseudorandom functions \(f_s\) from a secret seed s, so that knowledge of \(s\) not only enables one to evaluate \(f_s\) at any point x, but also to provide an NP-proof that the value \(f{_s}(x)\) is indeed correct without compromising the unpredictability of \(f_s\) at any other point for which no such a proof was provided.
Description
Other Available Sources
Keywords
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service