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

DOI10.1007/978-3-030-38471-5_13zbMATH Open1453.94092OpenAlexW2999370997MaRDI QIDQ778928

David Niehues, Tibor Jager

Publication date: 21 July 2020

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

zbMATH Keywords

provable securityerror-correcting codesverifiable random functionsadmissible hash functions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Verifiable random functions with optimal tightness

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)