Verifiable random functions: relations to identity-based key encapsulation and new constructions
From MaRDI portal
Publication:744351
DOI10.1007/S00145-013-9153-XzbMath1302.94031OpenAlexW2075903118MaRDI QIDQ744351
Dario Catalano, Dario Fiore, Michel Abdalla
Publication date: 25 September 2014
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-013-9153-x
Related Items (5)
Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Verifiable random functions with optimal tightness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Families of finite sets in which no set is covered by the union of \(r\) others
- Bonsai trees, or how to delegate a lattice basis
- Generic constructions of identity-based and certificateless kEMs
- Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Identity-Based Cryptosystems and Signature Schemes
- Bounded CCA2-Secure Encryption
- 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
- Practical Identity-Based Encryption Without Random Oracles
- Weak Verifiable Random Functions
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Verifiable Random Functions from Identity-Based Key Encapsulation
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- New directions in cryptography
- A Pseudorandom Generator from any One-way Function
- Efficient Construction of (Distributed) Verifiable Random Functions
- Leftover Hash Lemma, Revisited
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Updatable Zero-Knowledge Databases
- Public Key Cryptography - PKC 2005
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2004
This page was built for publication: Verifiable random functions: relations to identity-based key encapsulation and new constructions
