Verifiable Random Functions from Identity-Based Key Encapsulation
From MaRDI portal
Publication:3627457
DOI10.1007/978-3-642-01001-9_32zbMath1239.94030OpenAlexW1497579132MaRDI QIDQ3627457
Dario Fiore, Michel Abdalla, Dario Catalano
Publication date: 12 May 2009
Published in: Advances in Cryptology - EUROCRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01001-9_32
Related Items (10)
An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ On the leakage-resilient key exchange ⋮ Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Simulatable verifiable random function from the LWE assumption ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generic constructions of identity-based and certificateless kEMs
- Identity-Based Cryptosystems and Signature Schemes
- Security Analysis of the Strong Diffie-Hellman Problem
- Practical Identity-Based Encryption Without Random Oracles
- Simulatable VRFs with Applications to Multi-theorem NIZK
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Efficient Construction of (Distributed) Verifiable Random Functions
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Updatable Zero-Knowledge Databases
- Public Key Cryptography - PKC 2005
- Theory of Cryptography
This page was built for publication: Verifiable Random Functions from Identity-Based Key Encapsulation