Location-Sharing Systems With Enhanced Privacy in Mobile Online Social Networks

被引:42
作者
Li, Jin [1 ]
Yan, Hongyang [2 ]
Liu, Zheli [3 ]
Chen, Xiaofeng [4 ]
Huang, Xinyi [5 ]
Wong, Duncan S. [6 ]
机构
[1] Jinan Univ, Coll Informat Sci & Technol, Guangzhou 510610, Guangdong, Peoples R China
[2] Guangzhou Univ, Sch Math & Informat Sci, Guangzhou 510006, Guangdong, Peoples R China
[3] Nankai Univ, Coll Comp & Control Engn, Tianjin 300071, Peoples R China
[4] Xidian Univ, State Key Lab Integrated Serv Networks ISN, Xian 710071, Peoples R China
[5] Fujian Normal Univ, Sch Math & Comp Sci, Fujian Prov Key Lab Network Secur & Cryptol, Fuzhou 350117, Peoples R China
[6] City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
来源
IEEE SYSTEMS JOURNAL | 2017年 / 11卷 / 02期
基金
中国国家自然科学基金;
关键词
Anonymity; checkability; insider threats; location privacy; location sharing; mobile social networks;
D O I
10.1109/JSYST.2015.2415835
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Location sharing is one of the critical components in mobile online social networks (mOSNs), which has attracted much attention recently. With the advent of mOSNs, more and more users' location information will be collected by the service providers in mOSN. However, the users' privacy, including location privacy and social network privacy, cannot be guaranteed in the previous work without the trust assumption on the service providers. In this paper, aiming at achieving enhanced privacy against the insider attack launched by the service providers in mOSNs, we introduce a new architecture with multiple location servers for the first time and propose a secure solution supporting location sharing among friends and strangers in location-based applications. In our construction, the user's friend set in each friends' query submitted to the location servers is divided into multiple subsets by the social network server randomly. Each location server can only get a subset of friends, instead of the whole friends' set of the user as the previous work. In addition, for the first time, we propose a location-sharing construction which provides checkability of the searching results returned from location servers in an efficient way. We also prove that the new construction is secure under the stronger security model with enhanced privacy. Finally, we provide extensive experimental results to demonstrate the efficiency of our proposed construction.
引用
收藏
页码:439 / 448
页数:10
相关论文
共 24 条
[1]  
[Anonymous], 2003, P INT 2003 9 IFIP TC
[2]  
Bellare M, 1996, LECT NOTES COMPUT SC, V1070, P399
[3]   Short signatures from the Weil pairing [J].
Boneh, D ;
Lynn, B ;
Shacham, H .
JOURNAL OF CRYPTOLOGY, 2004, 17 (04) :297-319
[4]  
Canetti Ran, 2012, Information Theoretic Security. Proceedings of the 6th International Conference, ICITS 2012, P37, DOI 10.1007/978-3-642-32284-6_3
[5]  
Cox LP, 2007, MOBISYS '07: PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON MOBILE SYSTEMS, APPLICATIONS, AND SERVICES, P233
[6]   Unique in the Crowd: The privacy bounds of human mobility [J].
de Montjoye, Yves-Alexandre ;
Hidalgo, Cesar A. ;
Verleysen, Michel ;
Blondel, Vincent D. .
SCIENTIFIC REPORTS, 2013, 3
[7]   A survey of mobile cloud computing: architecture, applications, and approaches [J].
Dinh, Hoang T. ;
Lee, Chonho ;
Niyato, Dusit ;
Wang, Ping .
WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2013, 13 (18) :1587-1611
[8]  
Duckham M, 2005, LECT NOTES COMPUT SC, V3468, P152
[9]  
Duong-Hieu Phan, 2012, Information Security and Privacy. Proceedings 17th Australasian Conference, ACISP 2012, P308, DOI 10.1007/978-3-642-31448-3_23
[10]  
Feige Uriel, 1997, P 29 ANN ACM S THEOR, V97, P506, DOI DOI 10.1145/258533.258644