Achieve Efficient and Privacy-Preserving Proximity Detection Scheme for Social Applications

被引:0
作者
Wang, Fengwei [1 ,4 ]
Zhu, Hui [1 ]
Lu, Rongxing [2 ]
Liu, Fen [1 ]
Huang, Cheng [3 ]
Li, Hui [1 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian, Peoples R China
[2] Univ New Brunswick, Fac Comp Sci, Fredericton, NB, Canada
[3] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON, Canada
[4] Sci & Technol Commun Networks Lab, Shijiazhuang, Hebei, Peoples R China
来源
SECURITY AND PRIVACY IN COMMUNICATION NETWORKS, SECURECOMM 2017 | 2018年 / 238卷
基金
加拿大自然科学与工程研究理事会; 中国国家自然科学基金;
关键词
Location-based social application; Proximity detection; Privacy-preserving; Convex polygon spatial search; K-ANONYMITY; LOCATION;
D O I
10.1007/978-3-319-78813-5_17
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes an efficient scheme, named CPSS, to perform privacy-preserving proximity detection based on chiphertext of convex polygon spatial search. We consider a scenario where users have to submit their location and search information to the social application server for accessing proximity detection service of location-based social applications (LBSAs). With proximity detection, users can choose any polygon area on the map and search whether their friends are within the select region. Since the location and search information of users are sensitive, submitting these data over plaintext to the social application server raises privacy concerns. Hence, we propose a novel method, with which users can access proximity detection without divulging their search and location information. Specifically, the data of a user is blurred into chipertext in client, thus no one can obtain the sensitive information except the user herself/himself. We prove that the scheme can defend various security threats and validate our scheme using a real LBS dataset. Also, we show that our proposed CPSS is highly efficient in terms of computation complexity and communication overhead.
引用
收藏
页码:339 / 355
页数:17
相关论文
共 30 条
[1]  
[Anonymous], J DIABETES RES
[2]  
[Anonymous], 2013, P 12 INT ACM WORKSHO
[3]   Proximity Detection with RFID: A Step Toward the Internet of Things [J].
Bolic, Miodrag ;
Rostamian, Majed ;
Djuric, Petar M. .
IEEE PERVASIVE COMPUTING, 2015, 14 (02) :70-76
[4]  
Chen Q., 2016, P INT C INT THINGS C
[5]   Spatial cloaking for anonymous location-based services in mobile peer-to-peer environments [J].
Chow, Chi-Yin ;
Mokbel, Mohamed F. ;
Liu, Xuan .
GEOINFORMATICA, 2011, 15 (02) :351-380
[6]   Privacy Preserving Nearest Neighbor Search based on Topologies in Cellular Networks [J].
Daghmehchi-Firoozjaei, Mahdi ;
Yu, Jaegwan ;
Kim, Hyoungshick .
2015 IEEE 29TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS WORKSHOPS WAINA 2015, 2015, :146-149
[7]   RISK OF EXPOSURE [J].
Enserink, Martin .
SCIENCE, 2015, 347 (6221) :498-500
[8]   ORIENTATION, SIMPLICITY, AND INCLUSION TEST FOR PLANAR POLYGONS [J].
FEITO, F ;
TORRES, JC ;
URENA, A .
COMPUTERS & GRAPHICS, 1995, 19 (04) :595-600
[9]   Protecting location privacy with personalized k-anonymity:: Architecture and algorithms [J].
Gedik, Bugra ;
Liu, Ling .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2008, 7 (01) :1-18
[10]   Secure Pervasive Social Communications Based on Trust in a Distributed Way [J].
Huang, Chaoyin ;
Yan, Zheng ;
Li, Ning ;
Wang, Mingjun .
IEEE ACCESS, 2016, 4 :9225-9238