Hierarchical Identity Based Encryption with Polynomially Many Levels

DOI10.1007/978-3-642-00457-5_26zbMath1213.94102OpenAlexW1563217018MaRDI 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

Cryptography (94A60)

Related Items (20)

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

This page was built for publication: Hierarchical Identity Based Encryption with Polynomially Many Levels