Verifiable random functions with optimal tightness

DOI10.1007/978-3-030-75248-4_3zbMath1479.94236OpenAlexW3164591282MaRDI QIDQ2061948

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_3

Related Items (5)

Optimal tightness for chain-based unique signatures ⋮ 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 ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Verifiable random functions with optimal tightness

Cites Work

Unnamed Item
Unnamed Item
Verifiable random functions: relations to identity-based key encapsulation and new constructions
On the real-world instantiability of admissible hash functions and efficient verifiable random functions
On the security loss of unique signatures
Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
Optimal security reductions for unique signatures: bypassing impossibilities with a counterexample
On the untapped potential of encoding predicates by arithmetic circuits and their applications
Simple and more efficient PRFs with tight security from LWE and matrix-DDH
Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
Verifiable random functions with optimal tightness
Adaptively secure constrained pseudorandom functions in the standard model
Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
On the adaptive security of MACs and PRFs
Verifiable Random Functions from Standard Assumptions
Fully, (Almost) Tightly Secure IBE and Dual System Groups
Optimal Security Proofs for Full Domain Hash, Revisited
Tightly-Secure Signatures from Lossy Identification Schemes
Waters Signatures with Optimal Security Reduction
Tightly Secure Signatures and Public-Key Encryption
Tightly-Secure Signatures from Chameleon Hash Functions
Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
Tight Proofs for Signature Schemes without Random Oracles
Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
Number-theoretic constructions of efficient pseudo-random functions
New Generation of Secure and Practical RSA-Based Signatures
Constructing Verifiable Random Functions with Large Input Spaces
Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
Verifiable Random Functions from Weaker Assumptions
Advances in Cryptology - EUROCRYPT 2004
Advances in Cryptology – CRYPTO 2004
Efficient Identity-Based Encryption Without Random Oracles
Why Proving HIBE Systems Secure Is Difficult
On the Impossibility of Tight Cryptographic Reductions
Verifiable random functions from non-interactive witness-indistinguishable proofs
Discrete logarithm problems with auxiliary inputs
Adaptive-Secure VRFs with Shorter Keys from Static Assumptions

This page was built for publication: Verifiable random functions with optimal tightness