Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
From MaRDI portal
Publication:2289439
Recommendations
- Verifiable random functions from standard assumptions
- A generic approach to constructing and proving verifiable random functions
- Verifiable random functions from weaker assumptions
- Verifiable random functions with optimal tightness
- The price of verifiability: lower bounds for verifiable random functions
- Public Key Cryptography - PKC 2005
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Constructing verifiable random functions with large input spaces
Cited in
(14)- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Verifiable random functions with optimal tightness
- Simulatable verifiable random function from the LWE assumption
- Verifiable random functions from standard assumptions
- Constructing verifiable random functions with large input spaces
- Public Key Cryptography - PKC 2005
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
- The price of verifiability: lower bounds for verifiable random functions
- Verifiable Obtained Random Subsets for Improving SPHINCS+
- Practical verifiable random function with RKA security
- Unbiasable verifiable random functions
- Tighter adaptive IBEs and VRFs: revisiting Waters' artificial abort
- Key-homomorphic and aggregate verifiable random functions
- Constrained verifiable random functions without obfuscation and friends
This page was built for publication: Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289439)