Verifiable random functions

DOI10.1109/SFFCS.1999.814584MaRDI QIDQ7238276zbMATH OpenFDO

Authors Silvio Micali, Matthew Rabin, Salil Vadhan

Publication date 6 May 2026

Full work available at URL https://doi.org/10.1109/SFFCS.1999.814584

Mathematics Subject Classification ID

Graph theory (05Cxx) Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68Rxx) Nonnumerical algorithms (68W05) Quantum computation (81P68)

Cited in

(7)

• Rational secret sharing with competition
• Earpicks: tightly secure two-round multi and threshold signatures
• PACIFIC: privacy-preserving automated contact tracing featuring integrity against cloning
• Latency tradeoffs in blockchain capacity management
• Capybara and Tsubaki: verifiable random functions from group actions and isogenies
• Threshold oblivious pseudorandom functions from isogeny group actions
• Efficient construction of threshold BBS+ signatures and its extensions

This page was built for publication: Verifiable random functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238276)