Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
From MaRDI portal
Publication:5970987
DOI10.1016/j.tcs.2019.12.003zbMath1447.94049OpenAlexW2811025351MaRDI QIDQ5970987
Takahiro Matsuda, Shuichi Katsumata, Atsushi Takayasu
Publication date: 29 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.12.003
Related Items (3)
Efficient revocable identity-based encryption with short public parameters ⋮ Graphic lattices made by graph felicitous-type labelings and colorings of topological coding ⋮ Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
Cites Work
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- Revocable hierarchical identity-based encryption via history-free approach
- Revocable predicate encryption from lattices
- 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
- Revocable identity-based encryption from the computational Diffie-Hellman problem
- Server-aided revocable identity-based encryption from lattices
- Bonsai trees, or how to delegate a lattice basis
- Revocable hierarchical identity-based encryption
- Server-aided revocable attribute-based encryption
- Revocable identity-based encryption from codes with rank metric
- Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
- Efficient revocable identity-based encryption via subset difference methods
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Private Revocable Predicate Encryption
- Revocable Identity-Based Encryption from Lattices
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters
- Simplified Revocable Hierarchical Identity-Based Encryption from Lattices
- Conjunctive Broadcast and Attribute-Based Encryption
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Lattice (H)IBE in the Standard Model
- Adaptive-ID Secure Revocable Identity-Based Encryption
- Attribute-Based Encryption Supporting Direct/Indirect Revocation Modes
- Identity-Based Encryption from the Weil Pairing
- Revocable Identity-Based Encryption Revisited: Security Model and Construction
- Server-Aided Revocable Identity-Based Encryption
- On lattices, learning with errors, random linear codes, and cryptography
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
This page was built for publication: Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance