IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v33y2023i3ne2192.html
   My bibliography  Save this article

Privacy‐preserving and efficient user matching based on attribute encryption in mobile social networks

Author

Listed:
  • Lei Wu
  • Shengnan Zhao
  • Xia Wei
  • Lingzhen Meng

Abstract

With the rapid popularity of social networking platforms, users can be matched when sharing their profiles. However, there is a risk of leakage of sensitive user information during the user matching process, which leads to the lack of user privacy protection. In this paper, we propose a privacy protection scheme based on the encryption of hidden attributes during user matching in mobile social networks, which uses linear secret sharing scheme (LSSS) as the access structure based on ciphertext policy attribute‐based encryption (CP‐ABE), and the match server can perform friend recommendation by completing bi‐directional attribute matching determination without disclosing user attribute information. In addition, the use of selective keywords protects the privacy of requesters and publishers in selecting keywords and selecting plaintext attacks. The scheme reduces the encryption and decryption overhead for users by dividing encryption into a preparation phase and an online phase and shifting most of the decryption overhead from the requester to the match server. The experimental results show that the scheme ensures user privacy while effectively reducing communication overhead.

Suggested Citation

  • Lei Wu & Shengnan Zhao & Xia Wei & Lingzhen Meng, 2023. "Privacy‐preserving and efficient user matching based on attribute encryption in mobile social networks," International Journal of Network Management, John Wiley & Sons, vol. 33(3), May.
  • Handle: RePEc:wly:intnem:v:33:y:2023:i:3:n:e2192
    DOI: 10.1002/nem.2192
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2192
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.2192?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    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:wly:intnem:v:33:y:2023:i:3:n:e2192. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    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.