A practical privacy-preserving nearest neighbor searching method over encrypted spatial data

被引:0
作者
Zhang, Jing [1 ]
Li, Chuanwen [1 ]
机构
[1] Northeastern Univ, Sch Comp Sci & Engn, 195 Chuangxin Rd, Shenyang 110169, Liao Ning, Peoples R China
基金
中国国家自然科学基金;
关键词
Location-based service; Location privacy protection; Computational private information retrieval; Encrypted spatial data; Asymmetric scalar-product-preserving encryption; Encrypted index; LOCATION PRIVACY; RETRIEVAL; EFFICIENT; ALGORITHM; QUERIES;
D O I
10.1007/s11227-023-05170-x
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
To realize the great flexibility and cost savings for providing location-based service, data owners are incentivized to migrate their data to cloud servers. However, direct data outsourcing to untrusted servers may pose significant privacy risks. This paper proposes a practical privacy-preserving nearest neighbor searching method over encrypted spatial data. We simultaneously protect data and location privacy (access and pattern privacy) by encrypting data using asymmetric scalar-product-preserving encryption (ASPE) and performing computational private information retrieval (CPIR) on encrypted subspace datasets. To mitigate the performance degradation introduced by the combination of ASPE and CPIR, we propose a hierarchical index that enables users to safely obtain encrypted subspace datasets with configurable privacy, where different degrees of privacy can be traded off against query processing performance. Experiments demonstrate that our method outperforms the state-of-the-art method in efficiency while allowing for a flexible trade-off between performance and privacy.
引用
收藏
页码:14146 / 14171
页数:26
相关论文
共 38 条
[1]   Querying Encrypted Data [J].
Arasu, Arvind ;
Eguro, Ken ;
Kaushik, Raghav ;
Ramamurthy, Ravi .
SIGMOD'14: PROCEEDINGS OF THE 2014 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2014, :1259-1261
[2]  
Arasu A, 2015, PROC INT CONF DATA, P435, DOI 10.1109/ICDE.2015.7113304
[3]  
Bajaj S., 2011, SIGMOD, P205, DOI DOI 10.1145/1989323.1989346
[4]   Location privacy in pervasive computing [J].
Beresford, AR ;
Stajano, F .
IEEE PERVASIVE COMPUTING, 2003, 2 (01) :46-55
[5]  
Chang Z, 2016, PROC VLDB ENDOW, V9, P1113, DOI 10.14778/2994509.2994528
[6]  
Chen H, 2020, PROCEEDINGS OF THE 29TH USENIX SECURITY SYMPOSIUM, P2111
[7]   SVkNN: Efficient Secure and Verifiable k-Nearest Neighbor Query on the Cloud Platform [J].
Cui, Ningning ;
Yang, Xiaochun ;
Wang, Bin ;
Li, Jianxin ;
Wang, Guoren .
2020 IEEE 36TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2020), 2020, :253-264
[8]  
Flath DanielD., 1988, INTRO NUMBER THEORY
[9]  
Ghinita G., 2008, SIGMOD, P121, DOI [DOI 10.1145/1376616.1376631, 10.1145/1376616.1376631]
[10]  
Gong Z, 2022, IEEE T DEPEND SECURE