Verifiable random functions: relations to identity-based key encapsulation and new constructions
From MaRDI portal
Recommendations
Cites work
- A forward-secure public-key encryption scheme
- A Pseudorandom Generator from any One-way Function
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A verifiable random function with short proofs and keys
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Bonsai trees, or how to delegate a lattice basis
- Bonsai trees, or how to delegate a lattice basis
- Bounded CCA2-Secure Encryption
- Coding constructions for blacklisting problems without computational assumptions
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Constructing verifiable random functions with large input spaces
- Efficient construction of (distributed) verifiable random functions
- Efficient Identity-Based Encryption Without Random Oracles
- Families of finite sets in which no set is covered by the union of \(r\) others
- Generic constructions of identity-based and certificateless kEMs
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- scientific article; zbMATH DE number 708808 (Why is no real title available?)
- scientific article; zbMATH DE number 2204782 (Why is no real title available?)
- Identity-based cryptosystems and signature schemes
- Identity-based encryption from the Weil pairing
- Key-insulated public key cryptosystems
- Leftover Hash Lemma, Revisited
- Micropayments revisited
- New directions in cryptography
- Practical Identity-Based Encryption Without Random Oracles
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Secure identity based encryption without random oracles
- Security Analysis of the Strong Diffie-Hellman Problem
- Short group signatures
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Soundness in the public-key model
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2004
- Unique signatures and verifiable random functions from the DH-DDH separation
- Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
- Updatable Zero-Knowledge Databases
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Weak Verifiable Random Functions
Cited in
(12)- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Subversion-resilient signatures: definitions, constructions and applications
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Verifiable random functions with optimal tightness
- Verifiable random functions from standard assumptions
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Adaptively secure puncturable pseudorandom functions via puncturable identity-based KEMs
- Tighter adaptive IBEs and VRFs: revisiting Waters' artificial abort
- Capybara and Tsubaki: verifiable random functions from group actions and isogenies
- Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs
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)
