Hierarchical Identity Based Encryption with Polynomially Many Levels

DOI10.1007/978-3-642-00457-5_26zbMath1213.94102MaRDI QIDQ3611781

Craig Gentry, Shai Halevi

Publication date: 3 March 2009

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_26

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Unnamed Item, Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting, An efficient IBE scheme with tight security reduction in the random oracle model, Anonymous spatial encryption under affine space delegation functionality with full security, Efficient selective identity-based encryption without random oracles, Key continual-leakage resilient broadcast cryptosystem from dual system in broadcast networks, Efficient subtree-based encryption for fuzzy-entity data sharing, Revocable hierarchical identity-based encryption with shorter private keys and update keys, Dual trapdoor identity-based encryption with keyword search, Bonsai trees, or how to delegate a lattice basis, Relations between semantic security and anonymity in identity-based encryption, Revocable hierarchical identity-based encryption, Anonymous HIBE with short ciphertexts: full security in prime order groups, Extended dual system group and shorter unbounded hierarchical identity based encryption, Forward-secure revocable identity-based encryption, Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography, Another Look at Tightness, Anonymous Encryption with Partial-Order Subset Delegation Functionality, Semi-adaptive Security and Bundling Functionalities Made Generic and Easy, New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts