Simplified Revocable Hierarchical Identity-Based Encryption from Lattices

DOI10.1007/978-3-030-31578-8_6zbMath1444.94104OpenAlexW2980082332MaRDI QIDQ3297616

Chao Li, Juanyang Zhang, Huaxiong Wang, Shixiong Wang, Jingnan He

Publication date: 20 July 2020

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-31578-8_6

zbMATH Keywords

latticesdelegationidentity-based encryptionrevocation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Efficient revocable identity-based encryption with short public parameters ⋮ Revocable identity-based fully homomorphic signature scheme with signing key exposure resistance ⋮ Simplified server-aided revocable identity-based encryption from lattices ⋮ Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more ⋮ Efficient identity-based encryption with hierarchical key-insulation from HIBE ⋮ Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption ⋮ 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 ⋮ Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating shorter bases for hard random lattices
• Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Revocable Identity-Based Encryption from Lattices
• Identity-Based Cryptosystems and Signature Schemes
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
• Revocable Identity-Based Encryption Revisited: Security Model and Construction
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• 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: Simplified Revocable Hierarchical Identity-Based Encryption from Lattices