---
res:
bibo_abstract:
- "Verifiable random functions (VRFs) are essentially digital signatures with additional
properties, namely verifiable uniqueness and pseudorandomness, which make VRFs
a useful tool, e.g., to prevent enumeration in DNSSEC Authenticated Denial of
Existence and the CONIKS key management system, or in the random committee selection
of the Algorand blockchain.\r\n\r\nMost standard-model VRFs rely on admissible
hash functions (AHFs) to achieve security against adaptive attacks in the standard
model. Known AHF constructions are based on error-correcting codes, which yield
asymptotically efficient constructions. However, previous works do not clarify
how the code should be instantiated concretely in the real world. The rate and
the minimal distance of the selected code have significant impact on the efficiency
of the resulting cryptosystem, therefore it is unclear if and how the aforementioned
constructions can be used in practice.\r\n\r\nFirst, we explain inherent limitations
of code-based AHFs. Concretely, we assume that even if we were given codes that
achieve the well-known Gilbert-Varshamov or McEliece-Rodemich-Rumsey-Welch bounds,
existing AHF-based constructions of verifiable random functions (VRFs) can only
be instantiated quite inefficiently. Then we introduce and construct computational
AHFs (cAHFs). While classical AHFs are information-theoretic, and therefore work
even in presence of computationally unbounded adversaries, cAHFs provide only
security against computationally bounded adversaries. However, we show that cAHFs
can be instantiated significantly more efficiently. Finally, we use our cAHF to
construct the currently most efficient verifiable random function with full adaptive
security in the standard model.@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Tibor
foaf_name: Jager, Tibor
foaf_surname: Jager
- foaf_Person:
foaf_givenName: David
foaf_name: Niehues, David
foaf_surname: Niehues
foaf_workInfoHomepage: http://www.librecat.org/personId=36113
bibo_doi: 10.1007/978-3-030-38471-5_13
dct_date: 2020^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/0302-9743
- http://id.crossref.org/issn/1611-3349
- http://id.crossref.org/issn/9783030384708
- http://id.crossref.org/issn/9783030384715
dct_language: eng
dct_subject:
- Admissible hash functions
- Verifiable random functions
- Error-correcting codes
- Provable security
dct_title: On the Real-World Instantiability of Admissible Hash Functions and Efficient
Verifiable Random Functions@
...