Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption
From MaRDI portal
Publication:2035455
DOI10.1007/s10623-021-00880-wzbMath1466.94025OpenAlexW3160047847WikidataQ114690127 ScholiaQ114690127MaRDI QIDQ2035455
Atsushi Takayasu, Keita Emura, Yodai Watanabe
Publication date: 24 June 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00880-w
Related Items (4)
Efficient identity-based encryption with hierarchical key-insulation from HIBE ⋮ Revocable hierarchical identity-based encryption with adaptive security ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity ⋮ Revocable hierarchical identity-based authenticated key exchange
Cites Work
- Unnamed Item
- Unnamed Item
- An algebraic framework for Diffie-Hellman assumptions
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
- CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- From selective IBE to full IBE and selective HIBE
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- ABE with tag made easy. Concise framework and new instantiations in prime-order groups
- Revocable identity-based encryption from the computational Diffie-Hellman problem
- Adaptive-ID secure revocable hierarchical identity-based encryption
- Bonsai trees, or how to delegate a lattice basis
- Revocable identity-based encryption from codes with rank metric
- Identity-based broadcast encryption with efficient revocation
- Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
- Efficient revocable identity-based encryption via subset difference methods
- Wildcarded identity-based encryption
- Extended dual system group and shorter unbounded hierarchical identity based encryption
- Revocable Hierarchical Identity-Based Encryption: History-Free Update, Security Against Insiders, and Short Ciphertexts
- (Hierarchical) Identity-Based Encryption from Affine Message Authentication
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- Revocable Identity-Based Encryption from Lattices
- Secure Identity-Based Encryption in the Quantum Random Oracle Model
- Efficient (Anonymous) Compact HIBE from Standard Assumptions
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters
- Unbounded HIBE and Attribute-Based Encryption
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Simplified Revocable Hierarchical Identity-Based Encryption from Lattices
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Adaptive-ID Secure Revocable Identity-Based Encryption
- Efficient Delegation of Key Generation and Revocation Functionalities in Identity-Based Encryption
- Revocable Identity-Based Encryption Revisited: Security Model and Construction
- Generic Constructions of Revocable Identity-Based Encryption
- Hierarchical Identity-Based Encryption with Tight Multi-challenge Security
- Advances in Cryptology - EUROCRYPT 2004
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Tightly secure hierarchical identity-based encryption
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
This page was built for publication: Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption
