TY - JOUR
T1 - Privacy-Preserving Reverse Nearest Neighbor Query Over Encrypted Spatial Data
AU - Li, Xiaoguo
AU - Xiang, Tao
AU - Guo, Shangwei
AU - Li, Hongwei
AU - Mu, Yi
N1 - Funding Information:
This work was supported by the National Natural Science Foundation of China under Grants U20A20176, 62072062, and 61932006, and the Natural Science Foundation of Chongqing, China under Grant cstc2019jcyjjqX0026.
Publisher Copyright:
© 2021 IEEE.
PY - 2022/9
Y1 - 2022/9
N2 - With the advent of cloud computing, it has become more and more popular to outsource various services to the cloud for releasing the burden of local data storage and maintenance. However, it may cause serious privacy problems because the cloud may be untrusted. In this article, we study the privacy-preserving reverse nearest neighbor (PPRNN) query over encrypted spatial data. First, we introduce the concept of reference-locked order-preserving encryption (RL-OPE) with its construction and security proof, which reveals less information than traditional order-preserving encryption (OPE). Then, we present a novel PPRNN scheme in static setting based on structured encryption (SE) and the proposed RL-OPE, called sPPRNN. After that, we design a generic method that extends a PPRNN scheme in static setting to the counterpart in dynamic setting, called dPPRNN. Furthermore, we present a thorough privacy analysis of our proposal. Finally, we demonstrate its efficiency and effectiveness for practical deployment through extensive experiments.
AB - With the advent of cloud computing, it has become more and more popular to outsource various services to the cloud for releasing the burden of local data storage and maintenance. However, it may cause serious privacy problems because the cloud may be untrusted. In this article, we study the privacy-preserving reverse nearest neighbor (PPRNN) query over encrypted spatial data. First, we introduce the concept of reference-locked order-preserving encryption (RL-OPE) with its construction and security proof, which reveals less information than traditional order-preserving encryption (OPE). Then, we present a novel PPRNN scheme in static setting based on structured encryption (SE) and the proposed RL-OPE, called sPPRNN. After that, we design a generic method that extends a PPRNN scheme in static setting to the counterpart in dynamic setting, called dPPRNN. Furthermore, we present a thorough privacy analysis of our proposal. Finally, we demonstrate its efficiency and effectiveness for practical deployment through extensive experiments.
KW - Cloud storage
KW - order-preserving encryption
KW - reverse nearest neighbor query
KW - services computing
UR - http://www.scopus.com/inward/record.url?scp=85102683599&partnerID=8YFLogxK
U2 - 10.1109/TSC.2021.3065356
DO - 10.1109/TSC.2021.3065356
M3 - Journal article
AN - SCOPUS:85102683599
SN - 1939-1374
VL - 15
SP - 2954
EP - 2968
JO - IEEE Transactions on Services Computing
JF - IEEE Transactions on Services Computing
IS - 5
ER -