Weak Verifiable Random Functions

DOI10.1007/978-3-642-00457-5_33MaRDI QIDQ3611788zbMATH OpenOpenAlexFDO

Authors Zvika Brakerski, Guy N. Rothblum, Vinod Vaikuntanathan, Shafi Goldwasser

Publication date 3 March 2009

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00457-5_33

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from weaker assumptions
• Efficient Construction of (Distributed) Verifiable Random Functions
• The price of verifiability: lower bounds for verifiable random functions

Cited in

(19)

• Certifying trapdoor permutations, revisited
• On the security loss of unique signatures
• A generic approach to constructing and proving verifiable random functions
• Verifiable random functions with optimal tightness
• Practical post-quantum few-time verifiable random function with applications to Algorand
• Simulatable verifiable random function from the LWE assumption
• Verifiable random functions from standard assumptions
• Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
• Constrained verifiable random functions from indistinguishability obfuscation
• Simulatable VRFs with Applications to Multi-theorem NIZK
• Efficient Construction of (Distributed) Verifiable Random Functions
• Verifiable random functions from weaker assumptions
• Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• The price of verifiability: lower bounds for verifiable random functions
• Practical verifiable random function with RKA security
• Unbiasable verifiable random functions
• Verifiable random functions: relations to identity-based key encapsulation and new constructions

This page was built for publication: Weak Verifiable Random Functions

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