DocumentCode :
3449927
Title :
Verifiable random functions
Author :
Micali, Silvio ; Rabin, Michael ; Vadhan, Salil
Author_Institution :
Lab. for Comput. Sci., MIT, Cambridge, MA, USA
fYear :
1999
fDate :
1999
Firstpage :
120
Lastpage :
130
Abstract :
We efficiently combine unpredictability and verifiability by extending the Goldreich-Goldwasser-Micali (1986) construction of pseudorandom functions fs from a secret seed s, so that knowledge of s not only enables one to evaluate fs at any point x, but also to provide an NP-proof that the value fs(x) is indeed correct without compromising the unpredictability of fs at any other point for which no such a proof was provided
Keywords :
computational complexity; random functions; NP-proof; pseudorandom functions; unpredictability; verifiable random functions; Computer science; Contracts; Electrical capacitance tomography; Laboratories; Polynomials; Postal services; Terminology; Testing; US Department of Defense; Uniform resource locators;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1999. 40th Annual Symposium on
Conference_Location :
New York City, NY
ISSN :
0272-5428
Print_ISBN :
0-7695-0409-4
Type :
conf
DOI :
10.1109/SFFCS.1999.814584
Filename :
814584
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3449927
بازگشت