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

DOI10.1007/978-3-030-17259-6_14OpenAlexW2920377835MaRDI QIDQ2289439

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)

Related Items (4)

The price of verifiability: lower bounds for verifiable random functions ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Verifiable random functions with optimal tightness

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