loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
40th Annual Symposium on Foundations of Computer Science
Verifiable Random Functions
New York, New York
October 17-October 18
ISBN: 0-7695-0409-4
ASCII Text
x 
 
Silvio Micali, Salil Vadhan, Michael Rabin, "Verifiable Random Functions," Foundations of Computer Science, IEEE Annual Symposium on, pp. 120, 40th Annual Symposium on Foundations of Computer Science, 1999.
 
 
BibTex
x
 
@article{ 10.1109/SFFCS.1999.814584,
author = {Silvio Micali and Salil Vadhan and Michael Rabin},
title = {Verifiable Random Functions},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1999},
issn = {0272-5428},
pages = {120},
doi = {http://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814584},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - Verifiable Random Functions
SN - 0272-5428
SP
EP
A1 - Silvio Micali,
A1 - Salil Vadhan,
A1 - Michael Rabin,
PY - 1999
KW - pseudorandom functions
KW - RSA
KW - signature schemes
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
Silvio Micali, Massachusetts Institute of Technology
Salil Vadhan, Massachusetts Institute of Technology
Michael Rabin, Harvard University
We efficiently combine unpredictability and verifiability by extending the Goldreich-Goldwasser-Micali 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.
Index Terms:
pseudorandom functions, RSA, signature schemes
Citation:
Silvio Micali, Salil Vadhan, Michael Rabin, "Verifiable Random Functions," focs, pp.120, 40th Annual Symposium on Foundations of Computer Science, 1999
Usage of this product signifies your acceptance of the Terms of Use.