Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts

  • Authors:
  • Jae Hong Seo;Tetsutaro Kobayashi;Miyako Ohkubo;Koutarou Suzuki

  • Affiliations:
  • Department of Mathematical Sciences and ISaC-RIM, Seoul National University, Seoul, Korea;NTT Information Sharing Platform Labs, Tokyo, Japan;NTT Information Sharing Platform Labs, Tokyo, Japan;NTT Information Sharing Platform Labs, Tokyo, Japan

  • Venue:
  • Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose an anonymous Hierarchical Identity-Based Encryption (anonymous HIBE) scheme that has constant size ciphertexts. This means the size of the ciphertext does not depend on the depth of the hierarchy. Moreover, our scheme achieves the lowest computational cost because during the decryption phase the computational cost of decryption is constant. The security can be proven under reasonable assumptions without using random oracles because it is based on the composite order bilinear group. Our scheme achieves selective-ID security notion.