Say Hello Again: Privacy Preserving Matchmaking Using Cloud in Encounter Based Mobile Social Networks

被引:1
作者
Abbas, Fizza [1 ]
Rajput, Ubaidullah [1 ]
Wang, Jian [1 ,2 ]
Eun, Hasoo [1 ]
Oh, Heekuck [1 ]
机构
[1] Hanyang Univ, Dept Comp Sci & Engn, Seoul, South Korea
[2] Jilin Univ, Coll Comp Sci & Technol, Changchun, Jilin, Peoples R China
来源
2016 16TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID) | 2016年
关键词
Encounter based mobile social networks; profile matchmaking; privacy; cloud;
D O I
10.1109/CCGrid.2016.39
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Mobile social networks (MSNs) are getting increasingly popular day by day. With the help of MSNs people can connect with each other online as well as offline. One of the famous applications of MSNs is profile matchmaking in which users share their interests in order to find mutual friends. However, the user of such application can be a victim of various privacy related attacks due to the revelations of user's personal interests during profile matchmaking. More recent dimension of MSN is encounter-based social networks. In this scenario, the users make social contacts while sharing a common location and time. Mobile devices record the encounter information when two users are within physical proximity and at a later time, their encounter history should be matched when they try to find each other again. In this paper, we propose a privacy preserving matchmaking protocol in which users share the encounter information and later utilize a cloud server to post encounter information in order to privately match their profiles with unknowns to whom they shared the encounter. In our protocol, neither the users nor the cloud server is able to discover the interests of either participants during matchmaking. To the best of our knowledge, this approach is the first attempt that combines encounter based social networks and fine-grained profile matchmaking. Towards the end of the paper, we present security analysis as well as performance evaluation that shows the effectiveness and feasibility of our protocol.
引用
收藏
页码:453 / 457
页数:5
相关论文
共 8 条
  • [1] Abbas F., 2014, INFORM SECURITY APPL, P216
  • [2] [Anonymous], 2013, IEEE SYST J, DOI DOI 10.1109/JSYST.2013.2284696
  • [3] Cox LP, 2007, MOBISYS '07: PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON MOBILE SYSTEMS, APPLICATIONS, AND SERVICES, P233
  • [4] Secure friend discovery based on encounter history in mobile social networks
    Li, Hongjuan
    Chen, Yingwen
    Cheng, Xiuzhen
    Li, Keqiu
    Chen, Dechang
    [J]. PERSONAL AND UBIQUITOUS COMPUTING, 2015, 19 (07) : 999 - 1009
  • [5] Manweiler J, 2009, CCS'09: PROCEEDINGS OF THE 16TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P246
  • [6] Radio-telepathy: Extracting a Secret Key from an Unauthenticated Wireless Channel
    Mathur, Suhas
    Trappe, Wade
    Mandayam, Narayan
    Ye, Chunxuan
    Reznik, Alex
    [J]. MOBICOM'08: PROCEEDINGS OF THE FOURTEENTH ACM INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, 2008, : 128 - +
  • [7] Secure Encounter-Based Mobile Social Networks: Requirements, Designs, and Tradeoffs
    Mohaien, Abedelaziz
    Kune, Denis Foo
    Vasserman, Eugene Y.
    Kim, Myungsun
    Kim, Yongdae
    [J]. IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2013, 10 (06) : 380 - 393
  • [8] Paillier P, 1999, LECT NOTES COMPUT SC, V1716, P165