Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
From MaRDI portal
Recommendations
- Verifiable random functions from weaker assumptions
- Verifiable random functions from standard assumptions
- The price of verifiability: lower bounds for verifiable random functions
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- Public Key Cryptography - PKC 2005
Cites work
- scientific article; zbMATH DE number 1942446 (Why is no real title available?)
- scientific article; zbMATH DE number 2079926 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- An algebraic framework for Diffie-Hellman assumptions
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Bonsai trees, or how to delegate a lattice basis
- Constructing verifiable random functions with large input spaces
- Number-theoretic constructions of efficient pseudo-random functions
- Programmable Hash Functions and Their Applications
- Public Key Cryptography - PKC 2005
- Security Analysis of the Strong Diffie-Hellman Problem
- Verifiable random functions from standard assumptions
Cited in
(7)- Tighter adaptive IBEs and VRFs: revisiting Waters' artificial abort
- The price of verifiability: lower bounds for verifiable random functions
- Constrained verifiable random functions without obfuscation and friends
- 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
- Practical verifiable random function with RKA security
This page was built for publication: Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6162383)
