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.
Bibliographical noteFunding Information:
The authors thank the reviewers for their helpful comments and suggestions for this paper. Jong Hwan Park and Dong Hoon Lee were supported by the National Research Foundation of Korea (NRF) Grant funded by the Korea government (MEST) (No. 2012-0008697 ). Willy Susilo was supported by ARC Future Fellowship FT0991397 .
- Dual system encryption
- Hidden vector encryption
- Predicate encryption
- Search on encrypted data
ASJC Scopus subject areas
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence