Efficient computation on oblivious RAMs
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
FC'10 Proceedings of the 14th international conference on Financial cryptograpy and data security
Multi-User Private Keyword Search for Cloud Computing
CLOUDCOM '11 Proceedings of the 2011 IEEE Third International Conference on Cloud Computing Technology and Science
Privacy preserving keyword searches on remote encrypted data
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Generic construction of designated tester public-key encryption with keyword search
Information Sciences: an International Journal
Efficient Similarity Search over Encrypted Data
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data
IEEE Transactions on Parallel and Distributed Systems
Dynamic searchable symmetric encryption
Proceedings of the 2012 ACM conference on Computer and communications security
Information Sciences: an International Journal
Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
| Hi-index | 0.07 |
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.