Issue No. 01 - June (2013 vol. 1)
Haojin Zhu , Computer Science Department, Shanghai Jiao Tong University, Shanghai, China
Suguo Du , Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai, China
Muyuan Li , Computer Science Department, Shanghai Jiao Tong University, Shanghai, China
Zhaoyu Gao , Computer Science Department, Shanghai Jiao Tong University, Shanghai, China
Mobile social networks represent a promising cyber-physical system, which connects mobile nodes within a local physical proximity using mobile smart phones as well as wireless communication. In mobile social networks, the mobile users may, however, face the risk of leaking their personal information and location privacy. In this paper, we first model the secure friend discovery process as a generalized privacy-preserving interest and profile matching problem. We identify a new security threat arising from existing secure friend discovery protocols, coined as runaway attack, which can introduce a serious unfairness issue. To thwart this new threat, we introduce a novel blind vector transformation technique, which could hide the correlation between the original vector and transformed results. Based on this, we propose our privacy-preserving and fairness-aware interest and profile matching protocol, which allows one party to match its interest with the profile of another, without revealing its real interest and profile and vice versa. The detailed security analysis as well as real-world implementations demonstrate the effectiveness and efficiency of the proposed protocol.
Protocols, Cryptography, Mobile communication, Social network services, Mobile computing, Privacy
H. Zhu, S. Du, M. Li and Z. Gao, "Fairness-Aware and Privacy-Preserving Friend Matching Protocol in Mobile Social Networks," in IEEE Transactions on Emerging Topics in Computing, vol. 1, no. 1, pp. 192-200, 2013.