Search Results

In This Paper, We Study User Profile Matching With Privacy-preservation In Mobile Social Networks (MSNs) And Introduce A Family Of Novel Profile Matching Protocols. We First Propose An Explicit Comparison-based Profile Matching Protocol (eCPM) Which Runs Between Two Parties, An Initiator And A Responder. The ECPM Enables The Initiator To Obtain The Comparison-based Matching Result About A Specified Attribute In Their Profiles, While Preventing Their Attribute Values From Disclosure. We Then Propose An Implicit Comparison-based Profile Matching Protocol (iCPM) Which Allows The Initiator To Directly Obtain Some Messages Instead Of The Comparison Result From The Responder. The Messages Unrelated To User Profile Can Be Divided Into Multiple Categories By The Responder. The Initiator Implicitly Chooses The Interested Category Which Is Unknown To The Responder. Two Messages In Each Category Are Prepared By The Responder, And Only One Message Can Be Obtained By The Initiator According To The Comparison Result On A Single Attribute. We Further Generalize The ICPM To An Implicit Predicate-based Profile Matching Protocol (iPPM) Which Allows Complex Comparison Criteria Spanning Multiple Attributes. The Anonymity Analysis Shows All These Protocols Achieve The Confidentiality Of User Profiles. In Addition, The ECPM Reveals The Comparison Result To The Initiator And Provides Only Conditional Anonymity; The ICPM And The IPPM Do Not Reveal The Result At All And Provide Full Anonymity. We Analyze The Communication Overhead And The Anonymity Strength Of The Protocols. We Then Present An Enhanced Version Of The ECPM, Called ECPM+, By Combining The ECPM With A Novel Prediction-based Adaptive Pseudonym Change Strategy. The Performance Of The ECPM And The ECPM+ Are Comparatively Studied Through Extensive Trace-based Simulations. Simulation Results Demonstrate That The ECPM+ Achieves Significantly Higher Anonymity Strength With Slightly Larger Number Of Pseudonyms Than The ECPM.