Paper Info
Title
Fully secure hidden vector encryption under standard assumptions
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.
Year
DOI
Venue
2013
10.1016/j.ins.2012.12.034
Inf. Sci.
Keywords
Field
DocType
compress tag value,bilinear map,previous hve scheme,standard assumption,efficiency advantage,tag-based dual system encryption,new hve scheme,hve scheme,hidden vector encryption,conjunctive equality,predicate encryption,vector,standard,encryption
Multiple encryption,Attribute-based encryption,Deterministic encryption,Theoretical computer science,Encryption,40-bit encryption,Probabilistic encryption,On-the-fly encryption,Filesystem-level encryption,Mathematics
Journal
Volume
ISSN
Citations 
232,
0020-0255
6
PageRank 
References 
Authors
0.54
45
4
Name
Order
Citations
PageRank
Jong Hwan Park136733.30
Kwangsu Lee211720.83
Willy Susilo34823353.18
Dong Hoon Lee42024192.87