Compact Hierarchical IBE from Lattices in the Standard Model

DOI10.1007/978-3-319-89500-0_19zbMath1452.94095OpenAlexW2796998828MaRDI QIDQ3297499

Daode Zhang, Haiyang Xue, Bei Liang, Fuyang Fang, Bao Li

Publication date: 20 July 2020

Published in: Information and Communications Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89500-0_19

zbMATH Keywords

latticeshierarchical identity-based encryptioncompact public parametersselectively secure

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• On the Hardness of Learning with Rounding over Small Modulus
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• 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
• Hierarchical ID-Based Cryptography
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Compact Hierarchical IBE from Lattices in the Standard Model