Work

Verifiable random functions

Year: 2003

Type: conference-paper

Abstract: We efficiently combine unpredictability and verifiability by extending the Goldreich-Goldwasser-Micali (1986) construction of pseudorandom functions f/sub s/ from a secret seed s, so that knowledge of s not only enables one to evaluate f/sub s/ at any point x, but also to provide an NP-proof that the value f/sub s/(x) is indeed correct without compromising the unpredictability of f/sub s/ at any other point for which no such a proof was provided.

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sffcs.1999.814584

Authors: S. Micali, M. Rabin, S. Vadhan

Institutions: Massachusetts Institute of Technology, Harvard University

Language: English

Topic: Cryptography and Data Security

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, U.S. Department of Defense, Defense Advanced Research Projects Agency, National Defense Science and Engineering Graduate

Award: Efficient Cryptographic Protocols and Protection of Privacy