Fully Anonymous Profile Matching in Mobile Social Networks

被引:38
作者
Liang, Xiaohui [1 ]
Li, Xu [2 ]
Zhang, Kuan [1 ]
Lu, Rongxing [3 ]
Lin, Xiaodong [4 ]
Shen, Xuemin [1 ]
机构
[1] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
[2] Inria Lille Nord Europe, Lille, France
[3] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[4] Univ Ontario, Inst Technol, Fac Business & Informat Technol, Oshawa, ON, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Mobile social network; profile matching; privacy preservation; homomorphic encryption; oblivious transfer; COMPUTATION;
D O I
10.1109/JSAC.2013.SUP.0513056
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we study user profile matching with privacy-preservation in mobile social networks (MSNs) and introduce a family of novel profile matching protocols. We first propose an explicit Comparison-based Profile Matching protocol (eCPM) which runs between two parties, an initiator and a responder. The eCPM enables the initiator to obtain the comparison-based matching result about a specified attribute in their profiles, while preventing their attribute values from disclosure. We then propose an implicit Comparison-based Profile Matching protocol (iCPM) which allows the initiator to directly obtain some messages instead of the comparison result from the responder. The messages unrelated to user profile can be divided into multiple categories by the responder. The initiator implicitly chooses the interested category which is unknown to the responder. Two messages in each category are prepared by the responder, and only one message can be obtained by the initiator according to the comparison result on a single attribute. We further generalize the iCPM to an implicit Predicate-based Profile Matching protocol (iPPM) which allows complex comparison criteria spanning multiple attributes. The anonymity analysis shows all these protocols achieve the confidentiality of user profiles. In addition, the eCPM reveals the comparison result to the initiator and provides only conditional anonymity; the iCPM and the iPPM do not reveal the result at all and provide full anonymity. We analyze the communication overhead and the anonymity strength of the protocols. We then present an enhanced version of the eCPM, called eCPM+, by combining the eCPM with a novel prediction-based adaptive pseudonym change strategy. The performance of the eCPM and the eCPM+ are comparatively studied through extensive trace-based simulations. Simulation results demonstrate that the eCPM+ achieves significantly higher anonymity strength with slightly larger number of pseudonyms than the eCPM.
引用
收藏
页码:641 / 655
页数:15
相关论文
共 48 条
[1]  
Acquisti A., 2005, Proceedings of WPES05, P71
[2]  
[Anonymous], 2006, CRAWDAD trace cambridge/haggle/imote/content (v. 2006-09-15)
[3]  
[Anonymous], 2009, Proceedings of the 18th international conference on World wide web, DOI DOI 10.1145/1526709.1526781
[4]  
[Anonymous], P 29 IEEE INFOCOM C
[5]   Secret handshakes from pairing-based key agreements [J].
Balfanz, D ;
Durfee, G ;
Shankar, N ;
Smetters, D ;
Staddon, J ;
Wong, HC .
2003 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2003, :180-196
[6]  
Blake IF, 2004, LECT NOTES COMPUT SC, V3329, P515
[7]  
Brereton M., 2009, OZCHI '09, P257
[8]   FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H] [J].
BRON, C ;
KERBOSCH, J .
COMMUNICATIONS OF THE ACM, 1973, 16 (09) :575-577
[9]   Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks [J].
Bulut, Eyuphan ;
Szymanski, Boleslaw K. .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2012, 23 (12) :2254-2265
[10]   Analyzing Privacy Designs of Mobile Social Networking Applications [J].
Chen, Guanling ;
Rahman, Faruq .
EUC 2008: PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING, VOL 2, WORKSHOPS, 2008, :83-88