A generic approach to constructing and proving verifiable random functions
From MaRDI portal
Recommendations
Cited in
(39)- Adaptively secure distributed PRFs from LWE
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Combiners for functional encryption, unconditionally
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Constant-space, constant-randomness verifiers with arbitrarily small error
- Amplifying the security of functional encryption, unconditionally
- 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
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- Communication complexity of Byzantine agreement, revisited
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- Simulatable verifiable random function from the LWE assumption
- Constrained verifiable random functions
- Constrained verifiable random functions from indistinguishability obfuscation
- Weak Zero-Knowledge beyond the Black-Box Barrier
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- 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
- Streaming functional encryption
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- Verifiable Obtained Random Subsets for Improving SPHINCS+
- Practical verifiable random function with RKA security
- Registered (inner-product) functional encryption
- A unified framework for succinct garbling from homomorphic secret sharing
- Dynamic bounded-collusion streaming functional encryption from minimal assumptions
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Verifiable random function from the Deuring correspondence and higher dimensional isogenies
- Efficient distributed randomness generation from minimal assumptions where \underline{PA}rties \underline{S}peak \underline{S}equentially \underline{O}nce
- Tighter adaptive IBEs and VRFs: revisiting Waters' artificial abort
- Key-homomorphic and aggregate verifiable random functions
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Adaptively secure streaming functional encryption
- Constrained verifiable random functions without obfuscation and friends
- On non-interactive blind signatures in the plain model using complexity leveraging
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)
