Generic Constructions of Revocable Identity-Based Encryption
From MaRDI portal
Publication:5040410
DOI10.1007/978-3-030-42921-8_22zbMath1499.94047OpenAlexW2940536740MaRDI QIDQ5040410
Publication date: 14 October 2022
Published in: Information Security and Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-42921-8_22
Related Items (7)
Efficient revocable identity-based encryption with short public parameters ⋮ Forward-secure revocable identity-based encryption ⋮ Revocable identity-based fully homomorphic signature scheme with signing key exposure resistance ⋮ Simplified server-aided revocable identity-based encryption from lattices ⋮ Efficient identity-based encryption with hierarchical key-insulation from HIBE ⋮ Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
Cites Work
- Unnamed Item
- Unnamed Item
- Adaptively secure identity-based broadcast encryption with constant size private keys and ciphertexts from the subgroups
- Revocable hierarchical identity-based encryption via history-free approach
- CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance
- Adaptive-ID secure revocable identity-based encryption from lattices via subset difference method
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Identity-based encryption from the Diffie-Hellman assumption
- From selective IBE to full IBE and selective HIBE
- Server-aided revocable identity-based encryption from lattices
- Bonsai trees, or how to delegate a lattice basis
- Server-aided revocable attribute-based encryption
- Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
- Efficient revocable identity-based encryption via subset difference methods
- Revocable Identity-Based Encryption from Lattices
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
- Identity-Based Cryptosystems and Signature Schemes
- New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Lattice (H)IBE in the Standard Model
- Adaptive-ID Secure Revocable Identity-Based Encryption
- Hierarchical ID-Based Cryptography
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Revocable Identity-Based Encryption Revisited: Security Model and Construction
- Server-Aided Revocable Identity-Based Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Fuzzy Identity-Based Encryption
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
This page was built for publication: Generic Constructions of Revocable Identity-Based Encryption
