Verifiable Random Functions

DSpace/Manakin Repository

Verifiable Random Functions

Citable link to this page

. . . . . .

Title: Verifiable Random Functions
Author: Micali, Silvio; Vadhan, Salil P.; Rabin, Michael O.

Note: Order does not necessarily reflect citation order of authors.

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.
Full Text & Related Files:
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.
Published Version: http://dx.doi.org/10.1109/SFFCS.1999.814584
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:5028196

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [6463]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
 
 

Search DASH


Advanced Search
 
 

Submitters