Journal
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
Volume 20, Issue 4, Pages 3358-3370Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TDSC.2022.3205670
Keywords
Spatial keyword queries; dynamic searchable symmetric encryption; location-based services; forward/backward privacy; content privacy
Ask authors/readers for more resources
This article investigates the problem of Dynamic Searchable Symmetric Encryption (DSSE) for spatial keyword queries, and presents a practical DSSESKQ construction based on geometric prefix encoding inverted-index and encrypted bitmap. Rigorous security analysis proves that our construction can achieve both forward/backward privacy and content privacy, resisting most existing leakage-abuse attacks. Evaluation results using real-world datasets demonstrate the efficiency and feasibility of our construction. Comparative analysis reveals that our construction outperforms state-of-the-art schemes in terms of privacy and performance, being 175x faster than existing schemes with only 51% server storage cost.
Spatial keyword queries are attractive techniques that have been widely deployed in real-life applications in recent years, such as social networks and location-based services. However, existing solutions neither support dynamic update nor satisfy the privacy requirements in real applications. In this article, we investigate the problem of Dynamic Searchable Symmetric Encryption (DSSE) for spatial keyword queries. First, we formulate the definition of DSSE for spatial keyword queries (namely, DSSESKQ) and extend the DSSE leakage functions to capture the leakages in DSSESKQ. Then, we present a practical DSSESKQ construction based on geometric prefix encoding inverted-index and encrypted bitmap. Rigorous security analysis proves that our construction can achieve not only forward/backward privacy but content privacy as well, which can resist the most existing leakage-abuse attacks. Evaluation results using real-world datasets demonstrate the efficiency and feasibility of our construction. Comparative analysis reveals that our construction outperforms state-of-the-art schemes in terms of privacy and performance, e.g., our construction is 175x faster than existing schemes with only 51% server storage cost.
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