Efficient quantification of profile matching risk in social networks using belief propagation

buir.contributor.authorAyday, Erman
dc.citation.epage130en_US
dc.citation.spage110en_US
dc.citation.volumeNumber12308 LNCSen_US
dc.contributor.authorHalimi, A.en_US
dc.contributor.authorAyday, Ermanen_US
dc.contributor.editorChen, L.
dc.contributor.editorLi, N.
dc.contributor.editorLiang, K.
dc.contributor.editorSchneider, S.
dc.coverage.spatialGuildford, United Kingdomen_US
dc.date.accessioned2021-03-04T13:40:14Z
dc.date.available2021-03-04T13:40:14Z
dc.date.issued2020
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionDate of Conference: 14-18 September 2020en_US
dc.descriptionConference Name: 25th European Symposium on Research in Computer Security, ESORICS 2020en_US
dc.description.abstractMany individuals share their opinions (e.g., on political issues) or sensitive information about them (e.g., health status) on the internet in an anonymous way to protect their privacy. However, anonymous data sharing has been becoming more challenging in today’s interconnected digital world, especially for individuals that have both anonymous and identified online activities. The most prominent example of such data sharing platforms today are online social networks (OSNs). Many individuals have multiple profiles in different OSNs, including anonymous and identified ones (depending on the nature of the OSN). Here, the privacy threat is profile matching: if an attacker links anonymous profiles of individuals to their real identities, it can obtain privacy-sensitive information which may have serious consequences, such as discrimination or blackmailing. Therefore, it is very important to quantify and show to the OSN users the extent of this privacy risk. Existing attempts to model profile matching in OSNs are inadequate and computationally inefficient for real-time risk quantification. Thus, in this work, we develop algorithms to efficiently model and quantify profile matching attacks in OSNs as a step towards real-time privacy risk quantification. For this, we model the profile matching problem using a graph and develop a belief propagation (BP)-based algorithm to solve this problem in a significantly more efficient and accurate way compared to the state-of-the-art. We evaluate the proposed framework on three real-life datasets (including data from four different social networks) and show how users’ profiles in different OSNs can be matched efficiently and with high probability. We show that the proposed model generation has linear complexity in terms of number of user pairs, which is significantly more efficient than the state-of-the-art (which has cubic complexity). Furthermore, it provides comparable accuracy, precision, and recall compared to state-of-the-art. Thanks to the algorithms that are developed in this work, individuals will be more conscious when sharing data on online platforms. We anticipate that this work will also drive the technology so that new privacy-centered products can be offered by the OSNs.en_US
dc.identifier.doi10.1007/978-3-030-58951-6_6en_US
dc.identifier.isbn9783030589509en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/11693/75787en_US
dc.language.isoEnglishen_US
dc.publisherSpringer Science and Business Media Deutschland GmbHen_US
dc.relation.isversionofhttps://dx.doi.org/10.1007/978-3-030-58951-6_6en_US
dc.source.titleLecture Notes in Computer Scienceen_US
dc.subjectSocial networksen_US
dc.subjectProfile matchingen_US
dc.subjectDeanonymizationen_US
dc.subjectPrivacy risk quantificationen_US
dc.titleEfficient quantification of profile matching risk in social networks using belief propagationen_US
dc.typeConference Paperen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Efficient_quantification_of_profile_matching_risk_in_social_networks_using_belief_propagation.pdf
Size:
887.44 KB
Format:
Adobe Portable Document Format
Description:
View / Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: