On the real-world instantiability of admissible hash functions and efficient verifiable random functions

DOI10.1007/978-3-030-38471-5_13MaRDI QIDQ778928zbMATH OpenOpenAlexFDO

Authors Tibor Jager, David Niehues

Publication date 21 July 2020

Full work available at URL https://doi.org/10.1007/978-3-030-38471-5_13

zbMATH Keywords

admissible hash functionserror-correcting codesprovable securityverifiable random functions

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Verifiable random functions from weaker assumptions
• Efficient Construction of (Distributed) Verifiable Random Functions
• The price of verifiability: lower bounds for verifiable random functions
• Verifiable random functions with optimal tightness
• Public Key Cryptography - PKC 2005

Cited in

(3)

• Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
• Verifiable random functions with optimal tightness
• Tighter adaptive IBEs and VRFs: revisiting Waters' artificial abort

This page was built for publication: On the real-world instantiability of admissible hash functions and efficient verifiable random functions

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