Back to Search
Start Over
Fully secure hidden vector encryption under standard assumptions
- Source :
-
Information Sciences . May2013, Vol. 232, p188-207. 20p. - Publication Year :
- 2013
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00200255
- Volume :
- 232
- Database :
- Academic Search Index
- Journal :
- Information Sciences
- Publication Type :
- Periodical
- Accession number :
- 85854407
- Full Text :
- https://doi.org/10.1016/j.ins.2012.12.034