Efficient privacy preserving matchmaking for mobile social networking

Abstract

SUMMARYDiscovering new friends who share common attributes, named as matchmaking, is one of the most popular applications in mobile social networking. The key security issue in matchmaking is to protect users' personal information. In this paper, we propose a novel privacy preserving matchmaking framework, which can help users to find new friends in mobile social networking without leaking their privacy information. A user (called initiator) can find the one who shares maximum number of common attributes with him (called best match) among nearby users (called candidates), and only exchange an attribute intersection set with the best match, while other candidates only know the size of the attribute intersection set mutually. The analysis and simulation results show that our protocol can resist both semi-honest and malicious attacks while providing efficient matchmaking functionality.

Towards Privacy Preserving Commutative Encryption-Based Matchmaking in Mobile Social Network

“…The protocols in [5] paved the way for secure commutative based matchmaking. The protocols [6] and [7] improved the functionality and shortcomings of [5]; however, they introduced trust related issues as well as allowed malicious users to go unnoticed after cheating. The authors of [8] successfully eliminated above mentioned flaws but their protocol is slightly costlier in terms of communications and computation.…”

“…Wang et al [7] proposed another protocol that attempt to overcome the shortcomings of both [5] and [6]. First, the protocol in [7] combines the two trusted servers into a single server.…”

“…First, the protocol in [7] combines the two trusted servers into a single server. Second, their protocol allows an initiator to run the protocol with several candidates in the first stage and finds the one candidate, described as the best match, with the most number of matches.…”

“…However, the main contribution seems to be the idea of finding the best match among a number of candidates. Many of the attacks on [6] are also possible in [7]. The unified servers till requires full trust of users, indeed, in the end of the protocol, the trusted server knows the result as well.…”