PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 20, 2003717 citationsOpen Access

Verifiable random functions

View Full Paper
SMSilvio MicaliAkamai (United States)MRM. O. RabinHarvard University PressSVSalil VadhanBoston University

Key Points

Key points are not available for this paper at this time.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Micali et al. (2003) studied this question.

synapsesocial.com/papers/6a19046f4dd69184e54f7745https://doi.org/10.1109/sffcs.1999.814584
Ask AI
Helpful
Bookmark
Share
View Full Paper