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

    Jeckmans, A., Tang, Q., & Hartel, P. H. (2011). Privacy-Preserving Profile Matching Using the Social Graph. In International Conference on Computational Aspects of Social Networks, CASoN 2011 (pp. 42-47). USA: IEEE Computer Society. https://doi.org/10.1109/CASON.2011.6085916
    Jeckmans, Arjan ; Tang, Qiang ; Hartel, Pieter H. / Privacy-Preserving Profile Matching Using the Social Graph. International Conference on Computational Aspects of Social Networks, CASoN 2011. USA : IEEE Computer Society, 2011. pp. 42-47
    @inproceedings{c87de3c6e5da459b87250de975f30dea,
    title = "Privacy-Preserving Profile Matching Using the Social Graph",
    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.",
    keywords = "IR-78973, METIS-281654, secret distribution, EWI-21020, profile privacy, Online Social Network, SCS-Cybersecurity, profile matching",
    author = "Arjan Jeckmans and Qiang Tang and Hartel, {Pieter H.}",
    note = "10.1109/CASON.2011.6085916",
    year = "2011",
    month = "10",
    doi = "10.1109/CASON.2011.6085916",
    language = "Undefined",
    isbn = "978-1-4577-1132-9",
    publisher = "IEEE Computer Society",
    pages = "42--47",
    booktitle = "International Conference on Computational Aspects of Social Networks, CASoN 2011",
    address = "United States",

    }

    Jeckmans, A, Tang, Q & Hartel, PH 2011, Privacy-Preserving Profile Matching Using the Social Graph. in International Conference on Computational Aspects of Social Networks, CASoN 2011. IEEE Computer Society, USA, pp. 42-47. https://doi.org/10.1109/CASON.2011.6085916

    Privacy-Preserving Profile Matching Using the Social Graph. / Jeckmans, Arjan; Tang, Qiang; Hartel, Pieter H.

    International Conference on Computational Aspects of Social Networks, CASoN 2011. USA : IEEE Computer Society, 2011. p. 42-47.

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

    TY - GEN

    T1 - Privacy-Preserving Profile Matching Using the Social Graph

    AU - Jeckmans, Arjan

    AU - Tang, Qiang

    AU - Hartel, Pieter H.

    N1 - 10.1109/CASON.2011.6085916

    PY - 2011/10

    Y1 - 2011/10

    N2 - 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.

    AB - 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.

    KW - IR-78973

    KW - METIS-281654

    KW - secret distribution

    KW - EWI-21020

    KW - profile privacy

    KW - Online Social Network

    KW - SCS-Cybersecurity

    KW - profile matching

    U2 - 10.1109/CASON.2011.6085916

    DO - 10.1109/CASON.2011.6085916

    M3 - Conference contribution

    SN - 978-1-4577-1132-9

    SP - 42

    EP - 47

    BT - International Conference on Computational Aspects of Social Networks, CASoN 2011

    PB - IEEE Computer Society

    CY - USA

    ER -

    Jeckmans A, Tang Q, Hartel PH. Privacy-Preserving Profile Matching Using the Social Graph. In International Conference on Computational Aspects of Social Networks, CASoN 2011. USA: IEEE Computer Society. 2011. p. 42-47 https://doi.org/10.1109/CASON.2011.6085916