Constructing Verifiable Random Functions with Large Input Spaces
From MaRDI portal
Publication:3563860
DOI10.1007/978-3-642-13190-5_33zbMath1280.94068OpenAlexW1547442962MaRDI QIDQ3563860
Susan Hohenberger, Brent Waters
Publication date: 1 June 2010
Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_33
Related Items (13)
An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Adaptive-Secure VRFs with Shorter Keys from Static Assumptions ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Simulatable verifiable random function from the LWE assumption ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Verifiable random functions with optimal tightness
This page was built for publication: Constructing Verifiable Random Functions with Large Input Spaces
