Hunting and gathering -- verifiable random functions from standard assumptions with short proofs

DOI10.1007/978-3-030-17259-6_14MaRDI QIDQ2289439zbMATH OpenOpenAlexFDO

Authors Lisa Kohl

Publication date 28 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17259-6_14

zbMATH Keywords

non-interactive constant-size assumptionsymmetric bilinear groups

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Verifiable random functions from standard assumptions
• A generic approach to constructing and proving verifiable random functions
• Verifiable random functions from weaker assumptions
• Verifiable random functions with optimal tightness
• The price of verifiability: lower bounds for verifiable random functions
• Public Key Cryptography - PKC 2005
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Constructing verifiable random functions with large input spaces

Cited in

(11)

• The price of verifiability: lower bounds for verifiable random functions
• Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
• Public Key Cryptography - PKC 2005
• Verifiable random functions from standard assumptions
• Unbiasable verifiable random functions
• Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
• Verifiable random functions with optimal tightness
• Verifiable Obtained Random Subsets for Improving SPHINCS+
• Constructing verifiable random functions with large input spaces
• Simulatable verifiable random function from the LWE assumption
• Practical verifiable random function with RKA security

This page was built for publication: Hunting and gathering -- verifiable random functions from standard assumptions with short proofs

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