A generic approach to constructing and proving verifiable random functions
From MaRDI portal
Publication:1690284
DOI10.1007/978-3-319-70503-3_18zbMath1412.94178OpenAlexW2750852313MaRDI QIDQ1690284
Rishab Goyal, Brent Waters, Venkata Koppula, Susan Hohenberger
Publication date: 19 January 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_18
Related Items (19)
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Adaptively secure distributed PRFs from LWE ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ Asymptotically quasi-optimal cryptography ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ From FE combiners to secure MPC and back ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Communication complexity of Byzantine agreement, revisited ⋮ Streaming functional encryption ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Combiners for functional encryption, unconditionally ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier
This page was built for publication: A generic approach to constructing and proving verifiable random functions
