Journal
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
Volume 10, Issue 9, Pages 1918-1926Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIFS.2015.2435697
Keywords
Searchable encryption; order preserving encryption; privacy; cloud computing
Funding
- National Natural Science Foundation of China [61170234, 60803155]
- Strategic Priority Research Program through the Chinese Academy of Sciences [XDA06030601]
- Science and Technology on Information Assurance Laboratory [KJ-13-02]
Ask authors/readers for more resources
For ranked search in encrypted cloud data, order preserving encryption (OPE) is an efficient tool to encrypt relevance scores of the inverted index. When using deterministic OPE, the ciphertexts will reveal the distribution of relevance scores. Therefore, Wang et al. proposed a probabilistic OPE, called one-to-many OPE, for applications of searchable encryption, which can flatten the distribution of the plaintexts. In this paper, we proposed a differential attack on one-to-many OPE by exploiting the differences of the ordered ciphertexts. The experimental results show that the cloud server can get a good estimate of the distribution of relevance scores by a differential attack. Furthermore, when having some background information on the outsourced documents, the cloud server can accurately infer the encrypted keywords using the estimated distributions.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available