Practical verifiable random function with RKA security
From MaRDI portal
Publication:6535499
Recommendations
Cites work
- A composable security treatment of ECVRF and batch verifications
- A generic approach to constructing and proving verifiable random functions
- A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications
- A verifiable random function with short proofs and keys
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Constructing verifiable random functions with large input spaces
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Practical post-quantum few-time verifiable random function with applications to Algorand
- Related-key security for pseudorandom functions beyond the linear barrier
- Soundness in the public-key model
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Verifiable random functions from standard assumptions
- Verifiable random functions from weaker assumptions
- Verifiable random functions with optimal tightness
This page was built for publication: Practical verifiable random function with RKA security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535499)