Abstract | ||
---|---|---|
With the growing popularity of outsourcing data and services to the cloud, performing queries on encrypted data becomes a promising technique. Searchable encryption (SE) allows encryption while still enabling search for a variety of data. However, most of the existing arts focus on rectangular range query on common database. Query on encrypted spatial database has not been well studied. Moreover, as a vital type of geometric query on spatial data, the circular range search (CRS) is widely utilized in Location-Based Services (LBSs) and computational geometry. A recently proposed CRS scheme achieved security and privacy requirements. However, it exhibits low performance in terms of encryption and search efficiency. In this paper, we propose an Efficient Privacy-preserving CRS scheme (EP-CRS) on outsourced spatial data. Specifically, our scheme achieves CRS by leveraging an R-tree based SE scheme and adding a trustedthird party (TTP) to system. Security analysis indicates that EP-CRS can preserve data and query privacy. In addition, we conduct real experiments and compare EP-CRS with the existing one to show that the proposal is more efficient in terms of data encryption, token generation and search. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1109/ICC.2016.7511323 | 2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) |
Field | DocType | ISSN |
Data mining,Computer science,Range query (data structures),Computer network,Encryption,Security analysis,40-bit encryption,Information privacy,Privacy software,Spatial database,Database,Cloud computing | Conference | 1550-3607 |
Citations | PageRank | References |
2 | 0.39 | 16 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hao Ren | 1 | 25 | 8.99 |
Li Hongwei | 2 | 535 | 61.38 |
Hao Chen | 3 | 3 | 2.09 |
Michael Kpiebaareh | 4 | 2 | 0.39 |
Lian Zhao | 5 | 435 | 41.88 |