Micali, SilvioRabin, MichaelVadhan, Salil2011-07-221999Micali, 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.0-7695-0409-40272-5428http://nrs.harvard.edu/urn-3:HUL.InstRepos:5028196We 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.en-USConference Paper2011-07-2210.1109/SFFCS.1999.814584