A generic approach to constructing and proving verifiable random functions

DOI10.1007/978-3-319-70503-3_18MaRDI QIDQ1690284zbMATH OpenOpenAlexFDO

Authors Rishab Goyal, Susan Hohenberger, Venkata Koppula, Brent Waters

Publication date 19 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-70503-3_18

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Weak Verifiable Random Functions
• Constrained verifiable random functions
• Verifiable random functions from weaker assumptions

Cited in

(28)

• Constrained verifiable random functions from indistinguishability obfuscation
• Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
• Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
• Combiners for functional encryption, unconditionally
• Weak Zero-Knowledge beyond the Black-Box Barrier
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
• Adaptively secure distributed PRFs from LWE
• The price of verifiability: lower bounds for verifiable random functions
• Constant-space, constant-randomness verifiers with arbitrarily small error
• Communication complexity of Byzantine agreement, revisited
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable Obtained Random Subsets for Improving SPHINCS+
• Registered (inner-product) functional encryption
• From FE combiners to secure MPC and back
• Amplifying the security of functional encryption, unconditionally
• Constrained verifiable random functions
• Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
• Practical verifiable random function with RKA security
• Logarithmic-size (linkable) threshold ring signatures in the plain model
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Simulatable verifiable random function from the LWE assumption
• Practical post-quantum few-time verifiable random function with applications to Algorand
• Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
• Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
• Streaming functional encryption
• Asymptotically quasi-optimal cryptography

This page was built for publication: A generic approach to constructing and proving verifiable random functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690284)