Verifiable Random Functions from Standard Assumptions
From MaRDI portal
Publication:2796131
DOI10.1007/978-3-662-49096-9_14zbMath1348.94056OpenAlexW2296466110MaRDI QIDQ2796131
Publication date: 23 March 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_14
Related Items (10)
On the round complexity of randomized Byzantine agreement ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Adaptive-Secure VRFs with Shorter Keys from Static Assumptions ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Partitioned searchable encryption ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Verifiable random functions with optimal tightness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Programmable Hash Functions in the Multilinear Setting
- An Algebraic Framework for Diffie-Hellman Assumptions
- Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
- From Selective to Full Security: Semi-generic Transformations in the Standard Model
- Constrained Verifiable Random Functions
- Number-theoretic constructions of efficient pseudo-random functions
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Compact E-Cash and Simulatable VRFs Revisited
- Bonsai Trees, or How to Delegate a Lattice Basis
- Constructing Verifiable Random Functions with Large Input Spaces
- Security Analysis of the Strong Diffie-Hellman Problem
- Programmable Hash Functions and Their Applications
- Circular-Secure Encryption from Decision Diffie-Hellman
- Practical Compact E-Cash
- Weak Verifiable Random Functions
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Efficient Construction of (Distributed) Verifiable Random Functions
- Dual Form Signatures: An Approach for Proving Security from Static Assumptions
- Certifying RSA
- Verifiable Random Functions from Weaker Assumptions
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Déjà Q: Using Dual Systems to Revisit q-Type Assumptions
- Advances in Cryptology - CRYPTO 2003
- Updatable Zero-Knowledge Databases
- Public Key Cryptography - PKC 2005
- Public-Key Cryptosystems Resilient to Key Leakage
This page was built for publication: Verifiable Random Functions from Standard Assumptions
