SPFM : Scalable and Privacy-Preserving Friend Matching in Cloud

Authors(3) :-Mohini Dumre, Nilima Dhok, Sonal Ramteke

Profile data, interest, and mobility matching is more than important for fostering the wide use of 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. Here, users' personal information to the database 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 protocol, which aims to provide a scalable friend matching and recommendation solutions without revealing the users personal data to the cloud. The various from the previous works which have multiple number of protocols, it presents a scalable solution which can prevent honest and curious cloud from obtaining the original data and support the friend matching of multiple users simultaneously. The detailed feasibility and security analysis on it and its accuracy and security have been well demonstrated via extensive simulations. The result show that our system works even better when original data is large.

Authors and Affiliations

Mohini Dumre
Nagpur University, Nagpur, Maharashtra, India
Nilima Dhok
Nagpur University, Nagpur, Maharashtra, India
Sonal Ramteke

Profile, Social Network, WeChat, SPFM , Cloud.

  1. A. Acquisti, L. Brandimarte, and G. Loewenstein, "Privacy and human behavior in the age of information," Science , vol. 347, no. 6221, pp. 509-514, 2015.
  2. D. Lewis, "icloud data breach: Hacking and celebrity photos,"http://www.forbes.com/sites/davelewis/2014/09/02/icloud-data-breach- hacking-and-nude-celebrity-photos/.
  3. R. Shokri, G. Theodorakopoulos, C. Troncoso, J.-P. Hubaux, and J.-Y.Le Boudec, "Protecting location privacy: optimal strategy against local-ization attacks," inProceedings of the ACM conference on Computerand communications security ACM, 2012, pp. 617-627.
  4. M. Li, N. Cao, S. Yu, and W. Lou, "Findu: Privacy-preserving personalprofile matching in social networks," inIEEE INFOCOM. IEEE,2011, pp. 2435-2443.
  5. W. Dong, V. Dave, L. Qiu, and Y. Zhang, "Secure friend discovery in social networks," in IEEE INFOCOM. IEEE, 2011, pp. 1647-1655.
  6. J. He, M. Dong, K. Ota, M. Fan, and G. Wang, "Netseccc: A scalable and fault-tolerant architecture for cloud computing security,"Peer-to-Peer Networking and Applications, vol. 9, no. 1, pp. 67-81, 2016.
  7. M. Dong, H. Li, K. Ota, L. T. Yang, and H. Zhu, "Multicloud-based evacuation services for emergency management,"Cloud Computing,IEEE, vol. 1, no. 4, pp. 50-59, 2014.
  8. R. Lu, X. Lin, X. Liang, and X. Shen, "A secure handshake scheme withsymptoms-matching for mhealthcare social network," Networksand Applications, vol. 16, no. 6, pp. 683-694, 2011.
  9. M. Von Arb, M. Bader, M. Kuhn, and R. Wattenhofer, "Veneta: Server-less friend-of-friend detection in social networking," inIEEEInternational Conference on Wireless and Computing.IEEE, 2008, pp. 184-189.
  10. L. Kissner and D. Song, "Privacy-preserving set operations," inAdvancesin Cryptology-CRYPTO. Springer, 2005, pp. 241-257.

Publication Details

Published in : Volume 3 | Issue 3 | March-April 2018
Date of Publication : 2018-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 306-309
Manuscript Number : CSEIT183374
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Mohini Dumre, Nilima Dhok, Sonal Ramteke, "SPFM : Scalable and Privacy-Preserving Friend Matching in Cloud", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 3, pp.306-309, March-April-2018.
Journal URL : http://ijsrcseit.com/CSEIT183374

Article Preview

Follow Us

Contact Us