TY - GEN
T1 - Secure friend discovery based on encounter history in mobile social networks
AU - Li, Hongjuan
AU - Chen, Yingwen
AU - Cheng, Xiuzhen
AU - Li, Keqiu
AU - Chen, Dechang
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/3/19
Y1 - 2014/3/19
N2 - Mobile social networking becomes increasingly popular with the explosive growth of mobile devices. By allowing mobile users to interact with potential friends around the real world, it enables new social interactions as a complement to web-based online social networks. In this paper, we introduce a secure friend discovery mechanism based on encounter history in mobile social networks. By exploring the fact that sharing encounters indicate common activities and interests, our scheme can help people make friends with like-minded strangers nearby. We provide peer-to-peer confidential communications with the location privacy and encounter privacy being strictly preserved. Unlike most existing works that either rely on a trusted centralized server or existing social relationships, our algorithm is designed in an ad-hoc model with no such limitation. As a result, our design is more suitable and more general for mobile social scenarios. Extensive theoretical analysis and experimental study are conducted, and the results indicate that our scheme is feasible and effective for privacy-preserving friend discovery in mobile social networks.
AB - Mobile social networking becomes increasingly popular with the explosive growth of mobile devices. By allowing mobile users to interact with potential friends around the real world, it enables new social interactions as a complement to web-based online social networks. In this paper, we introduce a secure friend discovery mechanism based on encounter history in mobile social networks. By exploring the fact that sharing encounters indicate common activities and interests, our scheme can help people make friends with like-minded strangers nearby. We provide peer-to-peer confidential communications with the location privacy and encounter privacy being strictly preserved. Unlike most existing works that either rely on a trusted centralized server or existing social relationships, our algorithm is designed in an ad-hoc model with no such limitation. As a result, our design is more suitable and more general for mobile social scenarios. Extensive theoretical analysis and experimental study are conducted, and the results indicate that our scheme is feasible and effective for privacy-preserving friend discovery in mobile social networks.
KW - Mobile social networks
KW - encounter
KW - location privacy
KW - secure friend discovery
UR - http://www.scopus.com/inward/record.url?scp=84988214423&partnerID=8YFLogxK
U2 - 10.1109/IIKI.2014.64
DO - 10.1109/IIKI.2014.64
M3 - Conference contribution
AN - SCOPUS:84988214423
T3 - Proceedings - 2014 International Conference on Identification, Information and Knowledge in the Internet of Things, IIKI 2014
SP - 280
EP - 285
BT - Proceedings - 2014 International Conference on Identification, Information and Knowledge in the Internet of Things, IIKI 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 International Conference on Identification, Information and Knowledge in the Internet of Things, IIKI 2014
Y2 - 17 October 2014 through 18 October 2014
ER -