Efficient construction of (distributed) verifiable random functions

DOI10.1007/3-540-36288-6_1MaRDI QIDQ4414694zbMATH OpenOpenAlexFDO

Authors Yevgeniy Dodis

Publication date 27 July 2003

Published in Public Key Cryptography — PKC 2003 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-36288-6_1

zbMATH Keywords

digital signaturespseudorandom functionsverifiable random functions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Public Key Cryptography - PKC 2005
• Verifiable random functions from weaker assumptions
• The price of verifiability: lower bounds for verifiable random functions
• Weak Verifiable Random Functions
• Constructing verifiable random functions with large input spaces

Cited in

(36)

• Adaptively secure distributed PRFs from LWE
• On the impossibility of structure-preserving deterministic primitives
• Subversion-resilient signatures: definitions, constructions and applications
• Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
• 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
• Relation between verifiable random functions and convertible undeniable signatures, and new constructions
• Efficient rational secret sharing in standard communication networks
• Constructing verifiable random functions with large input spaces
• Practical Identity-Based Encryption Without Random Oracles
• Weak Verifiable Random Functions
• Simulatable VRFs with Applications to Multi-theorem NIZK
• Verifiable Random Functions from Identity-Based Key Encapsulation
• Unique signatures and verifiable random functions from the DH-DDH separation
• Verifiable random functions from weaker assumptions
• Public Key Cryptography - PKC 2005
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Efficient verifiable delay functions
• Classical and quantum security of elliptic curve VRF, via relative indifferentiability
• A composable security treatment of ECVRF and batch verifications
• Encapsulated search index: public-key, sub-linear, distributed, and delegatable
• The price of verifiability: lower bounds for verifiable random functions
• ParaDiSE: efficient threshold authenticated encryption in fully malicious model
• Post-quantum verifiable random function from symmetric primitives in PoS blockchain
• Practical verifiable random function with RKA security
• Traceable secret sharing: strong security and efficient constructions
• MUSEN: aggregatable key-evolving verifiable random functions and applications
• Traceable verifiable random functions
• Distributed randomness using weighted VUFs
• Arctic: lightweight and stateless threshold Schnorr signatures
• MATSE: amortized threshold symmetric-key encryption for matrices
• Verifiable random functions: relations to identity-based key encapsulation and new constructions
• On the real-world instantiability of admissible hash functions and efficient verifiable random functions

This page was built for publication: Efficient construction of (distributed) verifiable random functions

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