Verifiable random functions

Silvio Micali; Michael Rabin; Salil Vadhan

Verifiable random functions

Silvio Micali^*
, Michael Rabin
, Salil Vadhan

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

786 Scopus citations

Abstract

We efficiently combine unpredictability and verifiability by extending the Goldreich-Goldwasser-Micali construction 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.

Original language	English
Pages (from-to)	120-130
Number of pages	11
Journal	Annual Symposium on Foundations of Computer Science - Proceedings
State	Published - 1999
Externally published	Yes
Event	Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science - New York, NY, USA Duration: 17 Oct 1999 → 19 Oct 1999

Cite this

@article{741f239769724317afa36a81c5c1244e,

title = "Verifiable random functions",

abstract = "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.",

author = "Silvio Micali and Michael Rabin and Salil Vadhan",

year = "1999",

language = "אנגלית",

pages = "120--130",

journal = "Annual Symposium on Foundations of Computer Science - Proceedings",

issn = "0272-5428",

publisher = "IEEE Computer Society",

note = "Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science ; Conference date: 17-10-1999 Through 19-10-1999",

}

TY - JOUR

T1 - Verifiable random functions

AU - Micali, Silvio

AU - Rabin, Michael

AU - Vadhan, Salil

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0033346854

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0033346854

SN - 0272-5428

SP - 120

EP - 130

JO - Annual Symposium on Foundations of Computer Science - Proceedings

JF - Annual Symposium on Foundations of Computer Science - Proceedings

T2 - Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science

Y2 - 17 October 1999 through 19 October 1999

ER -

Verifiable random functions

Abstract

Other files and links

Fingerprint

Cite this