A Novel Friends Matching Privacy Preserving Strategy in Mobile Social Networks
LUO Entao①② WANG Guojun①③
①(School of Information Science and Engineering, Central South University, Changsha 410083, China) ②(School of Electronics and Information Engineering, Hunan University of Science and Engineering, Yongzhou 425006, China) ③(School of Computer Science and Educational Software, Guangzhou University, Guangzhou 510006, China)
In mobile social networks, people can quickly find potential friends with the same attributes by sharing personal attribute profile. These attribute profiles, however, usually contain sensitive information, if this information gets intercepted by malicious attackers it may result in unpredictable consequences. In this paper, a dual handshake privacy-preserving scheme is proposed based on user pseudo identity anonymous and hash value authentication, which is combined with identity authentication, one-way hash function and key agreement to ensure that malicious attackers can not get the real content of personal profile by identity fraud, attribute forgery, hacking security attributes and eavesdrop secure channel, thus the personal privacy can be protected. At the same time, the scheme relies on the powerful computing and anti-attack ability to trusted third party to reduce the computation cost of the intelligent terminal and security risks. Security and performance analysis demonstrates that this scheme is of high privacy, non-repudiation and verifiability and is more effective than existing solutions.
罗恩韬,王国军. 移动社交网络中一种朋友发现的隐私安全保护策略[J]. 电子与信息学报, 2016, 38(9): 2165-2172.
LUO Entao, WANG Guojun. A Novel Friends Matching Privacy Preserving Strategy in Mobile Social Networks. JEIT, 2016, 38(9): 2165-2172.
LI M, CAO N, Yu S, et al. Findu: privacy-preserving personal profile matching in mobile social networks[C]. Proceedings of INFOCOM, Shanghai, China, 2011: 2435-2443. doi: 10.1109 /INFCOM.2011.5935065.
ZHANG Rui, ZHANG Jinxue, Zhang Yanchao, et al. Privacy- preserving profile matching for proximity-based mobile social networking[J]. IEEE Journal on Selected Areas in Communications, 2013, 31(9): 656-668. doi: 10.1109/JSAC. 2013.SUP.0513057.[2]
[3]
JIANG W, WU J, WANG G, et al. Forming opinions via trusted friends: Time-evolving rating prediction using fluid dynamics[J]. IEEE Transactions on Computers, 2016: 65(4): 1211-1224. doi: 10.1109/TC.2015.2446842.
[4]
WEI D, VACHA D, ZHANG Y, et al. Secure friend discovery in mobile social networks[C]. Proceedings of INFOCOM, Shanghai, China, 2011: 1647-1655. doi: 10.1109/INFCOM. 2011.5934958.
[5]
NIU B, ZHU X, LIU J, et al. Weight-aware private matching scheme for proximity-based mobile social networks[C]. IEEE Global Communications Conference Exhibition & Industry Forum, Atlanta, USA, 2013: 3170-3175. doi: 10.1109/ GLOCOM.2013.6831559.
[6]
ZHANG Lan, LI Xiangyang, LIU Kebin, et al. Message in a sealed bottle: privacy preserving friending in mobile social networks[J]. IEEE Transactions on Mobile Computing, 2015, 14(9): 1888-1902. doi: 10.1109/TMC.2014.2366773.
[7]
ZHU X, LIU J, JIANG S, et al. Efficient weight-based private matching for proximity-based mobile social networks[C]. 2014 IEEE International Conference on Communications, Sydney, Australia, 2014: 4114-4119. doi: 10.1109/ICC.2014.6883965.
[8]
CAO Ning, WANG Cong, Li Ming, et al. Privacy- preserving multi-keyword ranked search over encrypted cloud data[J]. IEEE Transactions on Parallel & Distributed Systems, 2014, 25(1): 222-233. doi: 10.1109/TPDS.2013.45.
[9]
GUO Linke, ZHANG Chi, and SUN Jinyuan. A privacy-preserving attribute-based authentication system for mobile health networks[J]. IEEE Transactions on Mobile Computing, 2014, 13(9): 1927-1941. doi: 10.1109/TMC. 2013.84.
[10]
ZHU Haojin, DU Suguo, LI Muyuan, et al. Fairness-aware and privacy-preserving friend matching protocol in mobile social networks[J]. IEEE Transactions on Emerging Topics in Computing, 2013, 1(1): 192-200. doi: 10.1109/TETC.2013. 2279541.
HUO Zheng, MENG Xiaofeng, and HUANG Yi. Private CheckIn: Trajectory privacy-preserving for check-in services in MSNS[J]. Chinese Journal of Computers, 2013, 36(4): 716-726. doi: 10.3724/SP.J.1016.2013.00716.
[12]
KANTARCIOGLU M and CLIFTON C. Privacy-preserving distributed mining of association rules on horizontally partitioned data[J]. IEEE Transactions on Knowledge & Data Engineering, 2004, 16(9): 1026-1037. doi: 10.1109/TKDE. 2004.45.
CHOW S M, He Y J, Hui L C K, et al. Spicesimple privacy-preserving identity-management for cloud environment[C]. Applied Cryptography and Network Security, Berlin Heidelberg, Germany, 2012: 526-543. [13] doi: 10.1007/ 978-3-642-31284-7_31.
[14]
LINDELL Y and PINKAS B. An efficient protocol for secure two-party computation in the presence of malicious adversaries[J]. Journal of Cryptology, 2015, 28(2): 312-350. doi: 10.1007/s00145-014-9177-x.
[15]
HAZAY C and TOFT T. Computationally secure pattern matching in the presence of malicious adversaries[J]. Journal of Cryptology, 2014, 27(2): 358-395. doi: 10.1007/s00145- 013-9147-8.
ZHANG Yulei, WANG Huan, LI Chenyi, et al. Provable secure and compact certificateless aggregate signcryption scheme[J]. Journal of Electronics & Information Technology, 2015, 37(12): 2838-2843. doi: 10.11999/JEIT150407.
[17]
FREEDMAN M J, NISSIM K, and PINKAS B. Efficient private matching and set intersection[C]. Advances in Cryptology- EUROCRYPT, Berlin Heidelberg, Germany, 2004: 1-19. doi: 10.1007/978-3-540-24676-3_1.
[18]
LUO Entao, LIU Qin, and WANG Guojun. NMHP: a privacy preserving profile matching protocol in multi-hop proximity mobile social networks[C]. International Conference on Algorithms and Architectures for Parallel Processing, Zhangjiajie, China, 2015: 463-474. doi: 10.1007/978-3-319- 27137-8_34.
