Fully secure hidden vector encryption under standard assumptions
- Authors
- Park, Jong Hwan; Lee, Kwangsu; Susilo, Willy; Lee, Dong Hoon
- Issue Date
- 20-5월-2013
- Publisher
- ELSEVIER SCIENCE INC
- Keywords
- Predicate encryption; Hidden vector encryption; Search on encrypted data; Dual system encryption
- Citation
- INFORMATION SCIENCES, v.232, pp.188 - 207
- Indexed
- SCIE
SCOPUS
- Journal Title
- INFORMATION SCIENCES
- Volume
- 232
- Start Page
- 188
- End Page
- 207
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/103222
- DOI
- 10.1016/j.ins.2012.12.034
- ISSN
- 0020-0255
- Abstract
- Hidden Vector Encryption (HVE) is a special type of predicate encryption that can support conjunctive equality and range searches on encrypted data. All previous HVE schemes were proven to be either selectively secure or weakly attribute-hiding. In this paper, we first construct a new HVE scheme that is fully secure under standard assumptions. Our HVE scheme, which is based on bilinear maps (pairings), provides efficiency advantages in that it requires O(1)-sized private keys and O(1) pairing computations for decryption, regardless of both the number of conjunctives and the dimension of vectors. To achieve our goal, we develop a novel technique to realize a tag-based dual system encryption in prime-order groups and show how to hide vector components and compress tag values into one. (C) 2013 Elsevier Inc. All rights reserved.
- 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.