Privacy-Preserving Profile Matching Using the Social Graph

Arjan Jeckmans, Qiang Tang, Pieter H. Hartel

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    We present a privacy-preserving protocol for users to test a match with potential new friends in an environment where all users cryptographically encrypt their private information. The following scenario is considered. Suppose that user Alice thinks that Bob might be a good new friend. So, Alice and the Online Social Network (representing Bob) engage in a two-party matching protocol. In this protocol no work from Bob is required, Bob can be offline. The matching protocol is designed to give Alice an indication if Bob is similar to her based on their profiles. We show that the process does so without revealing the private information of Alice and Bob to one another and to the Online Social Network.
    Original languageUndefined
    Title of host publicationInternational Conference on Computational Aspects of Social Networks, CASoN 2011
    Place of PublicationUSA
    PublisherIEEE Computer Society
    Pages42-47
    Number of pages6
    ISBN (Print)978-1-4577-1132-9
    DOIs
    Publication statusPublished - Oct 2011

    Publication series

    Name
    PublisherIEEE Computer Society

    Keywords

    • IR-78973
    • METIS-281654
    • secret distribution
    • EWI-21020
    • profile privacy
    • Online Social Network
    • SCS-Cybersecurity
    • profile matching

    Cite this