Journal
INFORMATION SCIENCES
Volume 265, Issue -, Pages 176-188Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2013.11.021
Keywords
Search pattern; Searchable encryption; Cloud computing; Fake query; Grouping-based construction
Categories
Funding
- National Natural Science Foundation of China [61272512]
- National 863 Programme [2013AA01A212]
- Beijing Municipal Natural Science Foundation [4121001]
Ask authors/readers for more resources
Searching on remote encrypted data (commonly known as searchable encryption) has become an important issue in secure data outsourcing, since it allows users to outsource encrypted data to an untrusted third party while maintains the capability of keyword search on the data. Searchable encryption can be achieved using the classical method called oblivious RAM, but the resultant schemes are too inefficient to be applied in the real-world scenarios (e.g., cloud computing). Recently, a number of efficient searchable encryption schemes have been proposed under weaker security guarantees. Such schemes, however, still leak statistical information about the users' search pattern. In this paper, we first present two concrete attack methods to show that the search pattern leakage will result in such a situation: an adversary who has some auxiliary knowledge can uncover the underlying keywords of user queries. To address this issue, we then develop a grouping-based construction (GBC) to transform an existing searchable encryption scheme to a new scheme hiding the search pattern. Finally, experiments based on the real-world dataset demonstrate the effectiveness of our attack methods and the feasibility of our construction. (C) 2013 Elsevier Inc. All rights reserved.
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