Verifiable random functions with optimal tightness
From MaRDI portal
Recommendations
- The price of verifiability: lower bounds for verifiable random functions
- Verifiable random functions from weaker assumptions
- Weak Verifiable Random Functions
- Efficient Construction of (Distributed) Verifiable Random Functions
- Verifiable random functions from non-interactive witness-indistinguishable proofs
Cites work
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
- Adaptively secure constrained pseudorandom functions in the standard model
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Constructing verifiable random functions with large input spaces
- Cryptography with constant computational overhead
- Discrete logarithm problems with auxiliary inputs
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Efficient Identity-Based Encryption Without Random Oracles
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- scientific article; zbMATH DE number 2086712 (Why is no real title available?)
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- New generation of secure and practical RSA-based signatures
- Number-theoretic constructions of efficient pseudo-random functions
- On the adaptive security of MACs and PRFs
- On the impossibility of tight cryptographic reductions
- On the real-world instantiability of admissible hash functions and efficient verifiable random functions
- On the security loss of unique signatures
- On the untapped potential of encoding predicates by arithmetic circuits and their applications
- Optimal security proofs for full domain hash, revisited
- Optimal security reductions for unique signatures: bypassing impossibilities with a counterexample
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Tight proofs for signature schemes without random oracles
- Tightly Secure Signatures and Public-Key Encryption
- Tightly-Secure Signatures from Chameleon Hash Functions
- Tightly-secure signatures from lossy identification schemes
- Towards tightly secure lattice short signature and id-based encryption
- 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
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
- Waters signatures with optimal security reduction
- Why Proving HIBE Systems Secure Is Difficult
Cited in
(17)- Verifiable random functions with optimal tightness
- Constant-space, constant-randomness verifiers with arbitrarily small error
- Practical post-quantum few-time verifiable random function with applications to Algorand
- Optimal tightness for chain-based unique signatures
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- Simulatable verifiable random function from the LWE assumption
- Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions
- Classical and quantum security of elliptic curve VRF, via relative indifferentiability
- A composable security treatment of ECVRF and batch verifications
- Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness
- The price of verifiability: lower bounds for verifiable random functions
- 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
- Tighter adaptive IBEs and VRFs: revisiting Waters' artificial abort
- Constrained verifiable random functions without obfuscation and friends
- On the real-world instantiability of admissible hash functions and efficient verifiable random functions
This page was built for publication: Verifiable random functions with optimal tightness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061948)
