Optimal de-anonymization in random graphs with community structure

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Anonymized social network graphs published for academic or advertisement purposes are subject to de-anonymization attacks by leveraging side information in the form of a second, public social network graph correlated with the anonymized graph. This is because the two are from the same underlying graph of true social relationships. In this paper, the maximum a posteriori (MAP) estimates of user identities for the anonymized graph are characterized and sufficient conditions for successful de-anonymization for underlying graphs with community structure are provided. The results generalize prior work that assumed underlying graphs of Erdíís-Renyi type, and prove the optimality of the attack strategy adopted in the literature.

Original languageEnglish (US)
Title of host publicationConference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016
PublisherIEEE Computer Society
Pages709-713
Number of pages5
ISBN (Electronic)9781538639542
DOIs
StatePublished - Mar 1 2017
Event50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016 - Pacific Grove, United States
Duration: Nov 6 2016Nov 9 2016

Other

Other50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016
CountryUnited States
CityPacific Grove
Period11/6/1611/9/16

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Cite this

Onaran, E., Garg, S., & Erkip, E. (2017). Optimal de-anonymization in random graphs with community structure. In Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016 (pp. 709-713). [7869137] IEEE Computer Society. https://doi.org/10.1109/ACSSC.2016.7869137

Optimal de-anonymization in random graphs with community structure. / Onaran, Efe; Garg, Siddharth; Erkip, Elza.

Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016. IEEE Computer Society, 2017. p. 709-713 7869137.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Onaran, E, Garg, S & Erkip, E 2017, Optimal de-anonymization in random graphs with community structure. in Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016., 7869137, IEEE Computer Society, pp. 709-713, 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016, Pacific Grove, United States, 11/6/16. https://doi.org/10.1109/ACSSC.2016.7869137
Onaran E, Garg S, Erkip E. Optimal de-anonymization in random graphs with community structure. In Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016. IEEE Computer Society. 2017. p. 709-713. 7869137 https://doi.org/10.1109/ACSSC.2016.7869137
Onaran, Efe ; Garg, Siddharth ; Erkip, Elza. / Optimal de-anonymization in random graphs with community structure. Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016. IEEE Computer Society, 2017. pp. 709-713
@inproceedings{b9baa9f80ef94a5699f11314e5d94d19,
title = "Optimal de-anonymization in random graphs with community structure",
abstract = "Anonymized social network graphs published for academic or advertisement purposes are subject to de-anonymization attacks by leveraging side information in the form of a second, public social network graph correlated with the anonymized graph. This is because the two are from the same underlying graph of true social relationships. In this paper, the maximum a posteriori (MAP) estimates of user identities for the anonymized graph are characterized and sufficient conditions for successful de-anonymization for underlying graphs with community structure are provided. The results generalize prior work that assumed underlying graphs of Erd{\'i}{\'i}s-Renyi type, and prove the optimality of the attack strategy adopted in the literature.",
author = "Efe Onaran and Siddharth Garg and Elza Erkip",
year = "2017",
month = "3",
day = "1",
doi = "10.1109/ACSSC.2016.7869137",
language = "English (US)",
pages = "709--713",
booktitle = "Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016",
publisher = "IEEE Computer Society",
address = "United States",

}

TY - GEN

T1 - Optimal de-anonymization in random graphs with community structure

AU - Onaran, Efe

AU - Garg, Siddharth

AU - Erkip, Elza

PY - 2017/3/1

Y1 - 2017/3/1

N2 - Anonymized social network graphs published for academic or advertisement purposes are subject to de-anonymization attacks by leveraging side information in the form of a second, public social network graph correlated with the anonymized graph. This is because the two are from the same underlying graph of true social relationships. In this paper, the maximum a posteriori (MAP) estimates of user identities for the anonymized graph are characterized and sufficient conditions for successful de-anonymization for underlying graphs with community structure are provided. The results generalize prior work that assumed underlying graphs of Erdíís-Renyi type, and prove the optimality of the attack strategy adopted in the literature.

AB - Anonymized social network graphs published for academic or advertisement purposes are subject to de-anonymization attacks by leveraging side information in the form of a second, public social network graph correlated with the anonymized graph. This is because the two are from the same underlying graph of true social relationships. In this paper, the maximum a posteriori (MAP) estimates of user identities for the anonymized graph are characterized and sufficient conditions for successful de-anonymization for underlying graphs with community structure are provided. The results generalize prior work that assumed underlying graphs of Erdíís-Renyi type, and prove the optimality of the attack strategy adopted in the literature.

UR - http://www.scopus.com/inward/record.url?scp=85016303470&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85016303470&partnerID=8YFLogxK

U2 - 10.1109/ACSSC.2016.7869137

DO - 10.1109/ACSSC.2016.7869137

M3 - Conference contribution

SP - 709

EP - 713

BT - Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016

PB - IEEE Computer Society

ER -