Live briefing
Everything about Verifiable random function
Public-key cryptographic pseudorandom function
In cryptography, a verifiable random function (VRF) is a public-key pseudorandom function that provides proofs that its outputs were calculated correctly. The owner of the secret key can compute the function value as well as an associated proof for any input value. Everyone else, using the proof and the associated public key, can check that this value was indeed calculated correctly, yet this information cannot be used to find the secret key. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Verifiable random functionA 5-minute orientation
- Skim a recent paper: Quantum-Secure Hybrid Blockchain System for DID-Based Verifiable Random Function with NTRU Linkable Ring SignatureInfluential work since 2022
- Pick up a classic book: The Conspirators HierarchyThe most-reprinted book on the subject
- Read the landmark paper: Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New ConstructionsCited 32 times
- Go sideways: Pseudorandom permutationA closely related topic
- Go sideways: Pseudorandom function familyA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions
Proof of Random Leader: A Fast and Manipulation-Resistant Proof-of-Authority Consensus Algorithm for Permissioned Blockchains Using Verifiable Random Function
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
Capybara and Tsubaki: Verifiable Random Functions from Group Actions and Isogenies
Verifiable Random Function Schemes Based on SM2 Digital Signature Algorithm and its Applications for Committee Elections
An Anonymous Verifiable Random Function with Applications in Blockchain
Statically Aggregate Verifiable Random Functions and Application to E-Lottery
Verifiable random functions with Boolean function constraints
🆕 Influential since 2022
Quantum-Secure Hybrid Blockchain System for DID-Based Verifiable Random Function with NTRU Linkable Ring Signature
Obfuscating Verifiable Random Functions for Proof-of-Stake Blockchains
Simulatable verifiable random function from the LWE assumption
An anonymous verifiable random function with unbiasability and constant size proof
Consensus Optimization Algorithm for Distributed Intelligent Medical Diagnostic Collaborative Systems Based on Verifiable Random Functions and Reputation Mechanisms
📚 Books worth reading
The Conspirators HierarchyJohn Coleman · 1992
Why programs failAndreas Zeller · 2005
Murach's Python ProgrammingMichael Urban, Joel Murach · 2016
Ada in actionDo-While Jones · 1989
Advances in Cryptology – ASIACRYPT 2012Xiaoyun Wang · 2012
Practical reliability engineeringPatrick D. T. O'Connor · 2012
Awareness Techniques - Book 1William Swygard · 1975
Awareness Techniques by William SwygardWilliam Swygard · 1971
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Pseudorandom permutation In cryptography, a pseudorandom permutation (PRP) is a function that cannot be distinguished from a random permutation (that is, a permutation selected…
- Pseudorandom function family In cryptography, a pseudorandom function family, abbreviated PRF, is a collection of efficiently-computable functions which emulate a random oracle in…
- Commitment scheme A commitment scheme is a cryptographic primitive that allows one to commit to a chosen value (or chosen statement) while keeping it hidden to others, with…
- Cramer–Shoup cryptosystem The Cramer–Shoup system is an asymmetric key encryption algorithm, and was the first efficient scheme proven to be secure against adaptive chosen ciphertext…
- Verifiable secret sharing In cryptography, a secret sharing scheme is verifiable if auxiliary information is included that allows players to verify their shares as consistent. More…
- Pseudorandom generator In theoretical computer science and cryptography, a pseudorandom generator (PRG) for a class of statistical tests is a deterministic procedure that maps…
- Ideal lattice In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many…
- Decision Linear assumption The Decision Linear assumption (DLIN assumption) is a computational hardness assumption used in elliptic curve cryptography. In particular, the DLIN assumption…