Efficient and Privacy-Preserving Polygons Spatial Query Framework for Location-Based Services

被引:43
作者
Hui, Zhu [1 ]
Liu, Fen [1 ]
Li, Hui [1 ]
机构
[1] Xidian Univ, Sch Cyber Engn, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China
基金
中国国家自然科学基金;
关键词
Accuracy; location-based services (LBSs); polygons spatial query; privacy-preserving; SCHEME;
D O I
10.1109/JIOT.2016.2553083
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the pervasiveness of mobile devices and the development of wireless communication technique, location-based services (LBSs) have made our life more convenient, and the polygons spatial query, which can provide more flexible LBS, has attracted considerable interest recently. However, the flourish of polygons spatial query still faces many challenges including the query information privacy. In this paper, we present an efficient and privacy-preserving polygons spatial query framework for location-based services, called Polaris. With Polaris, the LBS provider (LP) outsources the encrypted LBS data to cloud server (CS), and the registered user can query any polygon range to get accurate LBS results without divulging his/her query information to the LP and CS. Specifically, an efficient special polygons spatial query (SPSQ) algorithm over ciphertext is constructed, based on an improved homomorphic encryption technology over composite order group. With SPSQ, Polaris can search outsourced encrypted LBS data in CS by the encrypted request, and respond the encrypted polygons spatial query results accurately. Detailed security analysis shows that the proposed Polaris can resist various known security threats. In addition, performance evaluations via implementing Polaris on smartphone and workstation with real LBS dataset demonstrate Polaris' effectiveness in term of real environment.
引用
收藏
页码:536 / 545
页数:10
相关论文
共 31 条
[1]   Privacy and human behavior in the age of information [J].
Acquisti, Alessandro ;
Brandimarte, Laura ;
Loewenstein, George .
SCIENCE, 2015, 347 (6221) :509-514
[2]  
[Anonymous], IEEE T DEPENDABLE SE
[3]  
[Anonymous], 2013, P 12 INT ACM WORKSHO
[4]  
Boneh D, 2005, LECT NOTES COMPUT SC, V3378, P325
[5]   Short signatures from the Weil pairing [J].
Boneh, D ;
Lynn, B ;
Shacham, H .
JOURNAL OF CRYPTOLOGY, 2004, 17 (04) :297-319
[6]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[7]  
Chan Nam Ngo, 2013, Information and Communication Technology. International Conference, ICT-EurAsia 2013. Proceedings: LNCS 7804, P101, DOI 10.1007/978-3-642-36818-9_11
[8]   A new efficient algorithm for computing Grobner bases (F4) [J].
Faugére, JC .
JOURNAL OF PURE AND APPLIED ALGEBRA, 1999, 139 (1-3) :61-88
[9]   ORIENTATION, SIMPLICITY, AND INCLUSION TEST FOR PLANAR POLYGONS [J].
FEITO, F ;
TORRES, JC ;
URENA, A .
COMPUTERS & GRAPHICS, 1995, 19 (04) :595-600
[10]   Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection [J].
Ghinita, Gabriel ;
Kalnis, Panos ;
Kantarcioglu, Murat ;
Bertino, Elisa .
GEOINFORMATICA, 2011, 15 (04) :699-726