Privacy-Preserving Profile Matching Using the Social Graph

Arjan Jeckmans; Qiang Tang; Pieter H. Hartel

doi:10.1109/CASON.2011.6085916

Privacy-Preserving Profile Matching Using the Social Graph

Arjan Jeckmans, Qiang Tang, Pieter H. Hartel

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

11 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 language	Undefined
Title of host publication	International Conference on Computational Aspects of Social Networks, CASoN 2011
Place of Publication	USA
Publisher	IEEE
Pages	42-47
Number of pages	6
ISBN (Print)	978-1-4577-1132-9
DOIs	https://doi.org/10.1109/CASON.2011.6085916
Publication status	Published - Oct 2011
Event	International Conference on Computational Aspects of Social Networks, CASoN 2011 - Salamanca, Spain, Salamanca, Spain Duration: 19 Oct 2011 → 21 Oct 2011

Publication series

Name
Publisher	IEEE Computer Society

Conference

Conference	International Conference on Computational Aspects of Social Networks, CASoN 2011
Abbreviated title	CASoN 2011
Country/Territory	Spain
City	Salamanca
Period	19/10/11 → 21/10/11

Keywords

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

Access to Document

10.1109/CASON.2011.6085916

http://eprints.eemcs.utwente.nl/secure2/21020/01/privacy_preserving_profile_matching_using_the_social_graph.pdf

Cite this

@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 ; International Conference on Computational Aspects of Social Networks, CASoN 2011 ; Conference date: 19-10-2011 Through 21-10-2011",

year = "2011",

month = oct,

doi = "10.1109/CASON.2011.6085916",

language = "Undefined",

isbn = "978-1-4577-1132-9",

publisher = "IEEE",

pages = "42--47",

booktitle = "International Conference on Computational Aspects of Social Networks, CASoN 2011",

address = "United States",

}

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

CY - USA

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

Y2 - 19 October 2011 through 21 October 2011

ER -