A Note on Adaptive Security in Hierarchical Identity-Based Encryption

Rishab Goyal; Venkata Koppula; Mahesh Sreekumar Rajasree

Paper 2025/291 Original: eprint.iacr.org/2025/291 ↗

A Note on Adaptive Security in Hierarchical Identity-Based Encryption

Rishab Goyal

Venkata Koppula

Mahesh Sreekumar Rajasree

Abstract

We present the first construction for adaptively secure HIBE, that does not rely on bilinear pairings or random oracle heuristics. Notably, we design an adaptively secure HIBE from any selectively secure IBE system in the standard model. Combining this with known results, this gives the first adaptively secure HIBE system from a wide variety of standard assumptions such as CDH/Factoring/LWE/LPN. We also extend our adaptively secure HIBE system to satisfy full anonymity, giving the first adaptively secure anonymous HIBE under CDH/LWE assumption. All our HIBE systems support unbounded length identities as well as unbounded number of recursive delegation operations.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2025-06-02: last updated; 2025-02-19: published
Short URL: https://ia.cr/2025/291
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2025/291,
      author = {Rishab Goyal and Venkata Koppula and Mahesh Sreekumar Rajasree},
      title = {A Note on Adaptive Security in Hierarchical Identity-Based Encryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/291},
      year = {2025},
      url = {https://eprint.iacr.org/2025/291}
}