Anonymous HIBE with Short Ciphertexts: Full Security in Prime Order Groups
This work addresses the need for secure and efficient anonymous communication systems and public key encryption with keyword searching, representing a significant advancement over previous schemes with weaker security or less efficient constructions.
The paper tackles the problem of constructing an efficient anonymous Hierarchical Identity-Based Encryption (HIBE) scheme with short ciphertexts and full security, achieving this by proposing the first such scheme in prime order groups and proving its security with an efficient reduction.
Anonymous Hierarchical Identity-Based Encryption (HIBE) is an extension of Identity-Based Encryption (IBE), and it provides not only a message hiding property but also an identity hiding property. Anonymous HIBE schemes can be applicable to anonymous communication systems and public key encryption systems with keyword searching. However, previous anonymous HIBE schemes have some disadvantages that the security was proven in the weaker model, the size of ciphertexts is not short, or the construction was based on composite order bilinear groups. In this paper, we propose the first efficient anonymous HIBE scheme with short ciphertexts in prime order (asymmetric) bilinear groups, and prove its security in the full model with an efficient reduction. To achieve this, we use the dual system encryption methodology of Waters. We also present the benchmark results of our scheme by measuring the performance of our implementation.