Anonymous HIBE: Compact Construction Over Prime-Order Groups
- Authors
- Park, Jong Hwan; Lee, Dong Hoon
- Issue Date
- 4월-2013
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Anonymity; bilinear maps; hierarchical identitybased encryption (HIBE)
- Citation
- IEEE TRANSACTIONS ON INFORMATION THEORY, v.59, no.4, pp.2531 - 2541
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON INFORMATION THEORY
- Volume
- 59
- Number
- 4
- Start Page
- 2531
- End Page
- 2541
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/103669
- DOI
- 10.1109/TIT.2012.2236918
- ISSN
- 0018-9448
- Abstract
- We present an anonymous hierarchical identity based encryption (HIBE) scheme that not only achieves constant-size ciphertext, but also works in bilinear groups with prime order. In contrast to our work, all previous anonymous HIBE schemes either have ciphertext size linear in the depth of the hierarchy or work in bilinear groups with a composite order. Our construction is more efficient than previous schemes in terms of ciphertext size and decryption cost. We give provable security of our construction, consisting of confidentiality and anonymity, without random oracles. To gain anonymity, we introduce a novel and simple method called "double exponent" technique, which gives an anonymous HIBE scheme more compact than the result at CRYPTO 2006. Our method is quite general in that it works on both symmetric and asymmetric bilinear maps. The simple method might also be of independent interest to gain anonymity of attributes in constructing searchable encryption schemes on encrypted data.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.