A Privacy Preserving Matchmaking Scheme for Multiple Mobile Social Networks

• Published in: Algorithms and Architectures for Parallel Processing pp. 233 - 240
• Main Authors: Wang, Yong, Li, Hong-zong, Zhang, Ting-Ting, Hou, Jie
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing 2013
• Series: Lecture Notes in Computer Science
• Subjects: homomorphic encryption; matchmaking protocol; mobile social network; privacy preserving
• ISBN: 9783319038889; 3319038885
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-03889-6_27

Mobile social networks (MSNs) enable users to discover and interact with existing and potential friends in both the cyberspace and in the real world. Although mobile social network applications bring us much convenience, privacy concerns become the key security issue affecting their wide applications. In this paper, we propose a novel hybrid privacy preserving matchmaking scheme, which can help users to find their friends without disclosing their private information from multiple MSNs. Specifically, a user (called initiator) can find his best-matches among the candidates and exchange common attributes with them. However, other candidates only know the size of the common attributes with the initiator. The simulation results indicate that our scheme has a good performance and scalability.