Unbiasable verifiable random functions

DOI10.1007/978-3-031-58737-5_6MaRDI QIDQ6637523zbMATH OpenFDO

Authors Emanuele Giunta, Alistair Stewart

Publication date 13 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-58737-5_6

Mathematics Subject Classification ID

Computer system organization (68Mxx)

Cites work

• A composable security treatment of ECVRF and batch verifications
• ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
• Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
• Constrained verifiable random functions
• Constructing verifiable random functions with large input spaces
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• scientific article; zbMATH DE number 1942446 (Why is no real title available?)
• scientific article; zbMATH DE number 2079926 (Why is no real title available?)
• Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Practical post-quantum few-time verifiable random function with applications to Algorand
• SCRAPE: scalable randomness attested by public entities
• Simulatable VRFs with Applications to Multi-theorem NIZK
• The algebraic group model and its applications
• The Discrete Logarithm problem with preprocessing
• The wonderful world of global random oracles
• Verifiable Random Functions from Identity-Based Key Encapsulation
• Verifiable random functions from standard assumptions
• Weak Verifiable Random Functions

Cited in

(2)

• Verifiable random function from the Deuring correspondence and higher dimensional isogenies
• Faster proofs and VRFs from isogenies

This page was built for publication: Unbiasable verifiable random functions

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