Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 716

The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.

Verifiable random functions

Open access
Micali, S., Rabin, M., Vadhan, S.·2003·40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/sffcs.1999.814584

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 19 references

Cited by

See all 716

Metadata

Authors
Micali, S., Rabin, M., & Vadhan, S.
Venue
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
Published
2003-01-20
Pages
120-130
ISSN
0272-5428 (ISSN-L)
OpenAlex
W2098104887
Cited by
716
References
19
FWCI
7.12
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Verifiable random functions. https://app.cochat.ai/papers/10.1109/sffcs.1999.814584
The paper
Micali, S., Rabin, M., & Vadhan, S. (2003). Verifiable random functions. 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). https://doi.org/10.1109/sffcs.1999.814584

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.