Verifiable random functions: relations to identity-based key encapsulation and new constructions
From MaRDI portal
Publication:744351
DOI10.1007/S00145-013-9153-XzbMATH Open1302.94031OpenAlexW2075903118MaRDI QIDQ744351FDOQ744351
Authors: Michel Abdalla, Dario Catalano, Dario Fiore 
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
Recommendations
Cites Work
- Generic constructions of identity-based and certificateless kEMs
- Identity-based cryptosystems and signature schemes
- Bonsai trees, or how to delegate a lattice basis
- Practical Identity-Based Encryption Without Random Oracles
- New directions in cryptography
- A Pseudorandom Generator from any One-way Function
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Title not available (Why is that?)
- Theory of Cryptography
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Security Analysis of the Strong Diffie-Hellman Problem
- Families of finite sets in which no set is covered by the union of \(r\) others
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2004
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Title not available (Why is that?)
- Bonsai trees, or how to delegate a lattice basis
- Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
- Bounded CCA2-Secure Encryption
- Constructing verifiable random functions with large input spaces
- Weak Verifiable Random Functions
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Efficient Construction of (Distributed) Verifiable Random Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Leftover Hash Lemma, Revisited
- Advances in Cryptology - EUROCRYPT 2004
- Updatable Zero-Knowledge Databases
- Public Key Cryptography - PKC 2005
Cited In (10)
- Subversion-resilient signatures: definitions, constructions and applications
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
- Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs
- Verifiable random functions from standard assumptions
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Verifiable random functions with optimal tightness
- Adaptively secure puncturable pseudorandom functions via puncturable identity-based KEMs
This page was built for publication: Verifiable random functions: relations to identity-based key encapsulation and new constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744351)
