Privacy-Preserving Profile Matching Using the Social Graph

Arjan Jeckmans, Qiang Tang, Pieter H. Hartel

    Research output: Book/ReportReportProfessional

    2 Citations (Scopus)
    64 Downloads (Pure)

    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
    Place of PublicationEnschede
    PublisherCentre for Telematics and Information Technology (CTIT)
    Number of pages6
    Publication statusPublished - 2011

    Publication series

    NameCTIT Technical Report Series
    PublisherUniversity of Twente, Centre for Telematics and Information Technology (CTIT)
    No.TR-CTIT-11-13
    ISSN (Print)1381-3625

    Keywords

    • METIS-277666
    • IR-77544
    • secret distribution
    • profile privacy
    • EWI-20239
    • Online Social Network
    • profile matching
    • SCS-Cybersecurity

    Cite this

    Jeckmans, A., Tang, Q., & Hartel, P. H. (2011). Privacy-Preserving Profile Matching Using the Social Graph. (CTIT Technical Report Series; No. TR-CTIT-11-13). Enschede: Centre for Telematics and Information Technology (CTIT).