SPFM: Scalable and Privacy-Preserving Friend Matching in Mobile Cloud

Profile (e.g., contact list, interest, and mobility) matching is more than important for fostering the wide use of mobile social networks. The social networks such as Facebook, Line, or WeChat recommend the friends for the users based on users personal data such as common contact list or mobility tr...

Full description

Saved in:
Bibliographic Details
Published in:IEEE internet of things journal 2017-04, Vol.4 (2), p.583-591
Main Authors: Li, Mengyuan, Ruan, Na, Qian, Qiyang, Zhu, Haojin, Liang, Xiaohui, Yu, Le
Format: Article
Language:English
Subjects:
Cloud computing
Cloud security
Facebook
friend matching
Matching
Mobile communication
Mobile computing
Personal information
Privacy
privacy preserving
Security
Servers
Social networks
XOR
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Profile (e.g., contact list, interest, and mobility) matching is more than important for fostering the wide use of mobile social networks. The social networks such as Facebook, Line, or WeChat recommend the friends for the users based on users personal data such as common contact list or mobility traces. However, outsourcing users' personal information to the cloud for friend matching will raise a serious privacy concern due to the potential risk of data abusing. In this paper, we propose a novel scalable and privacy-preserving friend matching (SPFM) protocol, which aims to provide a scalable friend matching and recommendation solutions without revealing the users personal data to the cloud. Different from the previous works which involves multiple rounds of protocols, SPFM presents a scalable solution which can prevent honest-but-curious mobile cloud from obtaining the original data and support the friend matching of multiple users simultaneously. We give detailed feasibility and security analysis on SPFM and its accuracy and security have been well demonstrated via extensive simulations. The result show that our scheme works even better when original data is large.
ISSN:2327-4662
2327-4662
DOI:10.1109/JIOT.2016.2582780