IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v3y2018i3idhcseit183374.html

SPFM : Scalable and Privacy-Preserving Friend Matching in Cloud

Author

Listed:
  • Mohini Dumre
  • Nilima Dhok
  • Sonal Ramteke

Abstract

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.

Suggested Citation

  • Mohini Dumre & Nilima Dhok & Sonal Ramteke, 2018. "SPFM : Scalable and Privacy-Preserving Friend Matching in Cloud," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 3(3), pages 306-309, April.
  • Handle: RePEc:jbh:ijsrcs:v3:y2018:i3:id:hcseit183374
    Note: Article URL: https://ijsrcseit.com/CSEIT183374
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT183374
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT183374.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v3:y2018:i3:id:hcseit183374. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.