Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-00468-1_13 | Public Key Cryptography |
Keywords | Field | DocType |
decryption phase,constant size ciphertexts,reasonable assumption,lowest computational cost,anonymous hierarchical identity-based encryption,computational cost,random oracle,anonymous hibe,selective-id security notion,composite order bilinear group | Semantic security,Composite order,Computer science,Attribute-based encryption,Random oracle,Encryption,Theoretical computer science,Probabilistic encryption,Ciphertext,Bilinear interpolation | Conference |
Volume | ISSN | Citations |
5443 | 0302-9743 | 58 |
PageRank | References | Authors |
1.45 | 23 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jae Hong Seo | 1 | 232 | 18.59 |
| Tetsutaro Kobayashi | 2 | 150 | 14.85 |
| Miyako Ohkubo | 3 | 667 | 26.32 |
| Koutarou Suzuki | 4 | 518 | 29.57 |