{"type":"ScholarlyArticle","title":"Deanonymizing Social Networks Using Structural Information","authors":[{"name":"Ioannis Caragiannis","slug":"ioannis-caragiannis","given":"Ioannis","family":"Caragiannis","affiliation":"University of Patras , Greece"},{"name":"Evanthia Tsitsoka","slug":"evanthia-tsitsoka","given":"Evanthia","family":"Tsitsoka","affiliation":"University of Patras , Greece"}],"abstract":"We study the following fundamental graph problem that models the important task of deanonymizing social networks. We are given a graph representing an eponymous social network and another graph, representing an anonymous social network, which has been produced by the original one after removing some of its nodes and adding some noise on the links. Our objective is to correctly associate as many nodes of the anonymous network as possible to their corresponding node in the eponymous network. We present two algorithms that attack the problem by exploiting only the structure of the two graphs. The first one exploits bipartite matching computations and is relatively fast. The second one is a local search heuristic which can use the outcome of our first algorithm as an initial solution and further improve it. We have applied our algorithms on inputs that have been produced by well-known random models for the generation of social networks as well as on inputs that use real social networks. Our algorithms can tolerate noise at the level of up to 10%. Interestingly, our results provide further evidence to which graph generation models are most suitable for modeling social networks and distinguish them from unrealistic ones.","doi":"10.24963/ijcai.2019/169","url":"https://ijcai.org/proceedings/2019/169","pdf":"https://ijcai.org/proceedings/2019/0169.pdf","markdown":"https://ijcai.org/proceedings/2019/169.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/169","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Heuristic Search and Game Playing","track":"Main track","number":169,"pages":{"first":1213,"last":1219},"keywords":["Machine Learning Applications: Networks","Agent-based and Multi-agent Systems: Computational Social Choice","Heuristic Search and Game Playing: Combinatorial Search and Optimisation"],"videos":[],"references":[{"position":1,"raw":"[Arvind et al., 2012] Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, and Yadu Vasudev. Approximate graph isomorphism. In Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 7464 of Lecture Notes in Com- puter Science, pages 100-111. Springer, 2012.","title":"Approximate graph isomorphism","authors":"Arvind Vikraman, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev","year":"2012","venue":"Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Babai et al., 1980] László Babai, Paul Erdös, and Stan- ley M. Selkow. Random graph isomorphism. SIAM Jour- nal on Computing, 9(3):628-635, 1980.","title":"Random graph isomorphism","authors":"László Babai, Paul Erdös, Stanley M Selkow","year":"1980","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Babai et al., 1983] L. Babai, W. M. Kantor, and E. M. Luks. Computational complexity and the classification of finite simple groups. In Proceedings of the 24th Annual Sympo- sium on Foundations of Computer Science (FOCS), pages 162-171, 1983.","title":"Computational complexity and the classification of finite simple groups","authors":"L Babai, W M Kantor, E M Luks","year":"1983","venue":"Proceedings of the 24th Annual Symposium on Foundations of Computer Science (FOCS)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Babai, 2016] László Babai. Graph isomorphism in quasipolynomial time. In Proceedings of the 48th An- nual ACM SIGACT Symposium on Theory of Computing (STOC), pages 684-697, 2016.","title":"Graph isomorphism in quasipolynomial time","authors":"László Babai, Babai","year":"2016","venue":"Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Backstrom et al., 2007] Lars Backstrom, Cynthia Dwork, and Jon Kleinberg. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and struc- tural steganography. In Proceedings of the 16th inter- national conference on World Wide Web, pages 181-190, 2007.","title":"Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography","authors":"Backstrom","year":"2007","venue":"Proceedings of the 16th international conference on World Wide Web","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Barabási and Albert, 1999] Albert-László Barabási and Réka Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.","title":"Emergence of scaling in random networks","authors":"Albert ; Albert-László Barabási, Réka Barabási, Albert","year":"1999","venue":"Science","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bollobás, 2001] Bella Bollobás. Random Graphs. Cam- bridge University Press, 2001.","title":"Random Graphs","authors":"Bella Bollobás","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Conte et al., 2004] Donatello Conte, Pasquale Foggia, Carlo Sansone, and Mario Vento. Thirty years of graph matching in pattern recognition. International Jour- nal of Pattern Recognition and Artificial Intelligence, 18(3):265-298, 2004.","title":"Thirty years of graph matching in pattern recognition","authors":"Conte","year":"2004","venue":"International Journal of Pattern Recognition and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Czajka and Pandurangan, 2008] Tomek Czajka and Gopal Pandurangan. Improved random graph isomorphism. Journal of Discrete Algorithms, 6(1):85-92, 2008.","title":"Improved random graph isomorphism","authors":"Tomek Czajka, Gopal Pandurangan","year":"2008","venue":"Journal of Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Gilbert, 1959] E. N. Gilbert. Random graphs. The Annals of Mathematical Statistics, 30(4):1141-1144, 1959.","title":"Random graphs","authors":"E N Gilbert","year":"1959","venue":"The Annals of Mathematical Statistics","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Grohe et al., 2018] Martin Grohe, Gaurav Rattan, and Ger- hard J. Woeginger. Graph similarity and approximate iso- morphism. In 43rd International Symposium on Mathe- matical Foundations of Computer Science (MFCS 2018), volume 117 of Leibniz International Proceedings in Infor- matics (LIPIcs), pages 20:1-20:16, 2018.","title":"Graph similarity and approximate isomorphism","authors":"Martin Grohe, Gaurav Rattan, Gerhard J Woeginger","year":"2018","venue":"43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hagberg et al., 2008] Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. Exploring network structure, dynam- ics, and function using NetworkX. In Proceedings of the 7th Python in Science Conference (SciPy), pages 11-15, 2008.","title":"Exploring network structure, dynamics, and function using NetworkX","authors":"A Aric, Daniel A Hagberg, Pieter J Schult, Swart","year":"2008","venue":"Proceedings of the 7th Python in Science Conference (SciPy)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Holme and Kim, 2002] Petter Holme and Beom Jun Kim. Growing scale-free networks with tunable clustering. Physical Review E, 65(2):026107:1-4, 2002.","title":"Growing scale-free networks with tunable clustering","authors":"Kim ; Holme, Petter Holme, Beom Jun, Kim","year":"2002","venue":"Physical Review E","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Jiang et al., 2017] Honglu Jiang, Jiguo Yu, Chunqiang Hu, Cheng Zhang, and Xiuzhen Cheng. SA framework based de-anonymization of social networks. In Proceedings of the 2017 International Conference on Identification, In- formation and Knowledge in the Internet of Things (IIKI), pages 358-363, 2017.","title":"SA framework based de-anonymization of social networks","authors":"Jiang","year":"2017","venue":"Proceedings of the 2017 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Kazemi et al., 2015] Ehsan Kazemi, S. Hamed Hassani, and Matthias Grossglauser. Growing a graph matching from a handful of seeds. Proceeding of the VLDB Endowment, 8(10):1010-1021, 2015.","title":"Growing a graph matching from a handful of seeds","authors":"S Hamed Ehsan Kazemi, Matthias Hassani, Grossglauser","year":"2015","venue":"Proceeding of the VLDB Endowment","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Leskovec and Krevl, 2014] Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, June 2014.","title":"SNAP Datasets: Stanford large network dataset collection","authors":"Jure Leskovec, Andrej Krevl","year":"2014","venue":null,"doi":null,"url":"http://snap.stanford.edu/data","internal_url":null},{"position":17,"raw":"[McKay and Piperno, 2014] Brendan D. McKay and Adolfo Piperno. Practical graph isomorphism, II. Journal of Sym- bolic Computation, 60:94 -112, 2014.","title":"Practical graph isomorphism","authors":"Brendan D Mckay, Adolfo Piperno","year":"2014","venue":"II. Journal of Symbolic Computation","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Narayanan and Shmatikov, 2009] Arvind Narayanan and Vitaly Shmatikov. De-anonymizing social networks. In IEEE Symposium on Security and Privacy, pages 173- 187. IEEE Computer Society, 2009.","title":"De-anonymizing social networks","authors":"Arvind Narayanan, Vitaly Shmatikov","year":"2009","venue":"IEEE Symposium on Security and Privacy","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Pedarsani and Grossglauser, 2011] Pedram Pedarsani and Matthias Grossglauser. On the privacy of anonymized net- works. In Proceedings of the 17th ACM SIGKDD Inter- national Conference on Knowledge Discovery and Data Mining (KDD), pages 1235-1243, 2011.","title":"On the privacy of anonymized networks","authors":"Pedram Pedarsani, Matthias Grossglauser","year":"2011","venue":"Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Qian et al., 2017] Jianwei Qian, Xiang-Yang Li, Yu Wang, Shaojie Tang, Taeho Jung, and Yang Fan. Social network de-anonymization: more adversarial knowledge, more users re-identified? CoRR, abs/1710.10998, 2017.","title":"Social network de-anonymization: more adversarial knowledge, more users re-identified?","authors":"Jianwei Qian, Xiang-Yang Li, Yu Wang, Shaojie Tang, Taeho Jung, Yang Fan","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Rossi and Ahmed, 2015] Ryan A. Rossi and Nesreen K. Ahmed. The network data repository with interactive graph analytics and visualization. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI), 2015.","title":"The network data repository with interactive graph analytics and visualization","authors":"Ryan A Rossi, Nesreen K Ahmed","year":"2015","venue":"Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Watts and Strogatz, 1998] Duncan J. Watts and Steven H. Strogatz. Collective dynamics of small-world networks. Nature, 393:440-442, 1998.","title":"Collective dynamics of small-world networks","authors":"Duncan J Watts, Steven H Strogatz","year":"1998","venue":"Nature","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}