{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:16:49Z","timestamp":1774725409516,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Council","award":["DP160101934"],"award-info":[{"award-number":["DP160101934"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3411931","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T05:31:04Z","timestamp":1603085464000},"page":"1485-1494","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["A Graph Matching Attack on Privacy-Preserving Record Linkage"],"prefix":"10.1145","author":[{"given":"Anushka","family":"Vidanage","sequence":"first","affiliation":[{"name":"The Australian National University, Canberra, Australia"}]},{"given":"Peter","family":"Christen","sequence":"additional","affiliation":[{"name":"The Australian National University, Canberra, Australia"}]},{"given":"Thilina","family":"Ranbaduge","sequence":"additional","affiliation":[{"name":"The Australian National University, Canberra, Australia"}]},{"given":"Rainer","family":"Schnell","sequence":"additional","affiliation":[{"name":"University Duisburg-Essen, Duisburg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Managing and Mining Graph Data. Advances in Database Systems","author":"Aggarwal Charu","unstructured":"Charu Aggarwal and Haixun Wang . 2010. Managing and Mining Graph Data. Advances in Database Systems , Vol. 40 . Springer . Charu Aggarwal and Haixun Wang. 2010. Managing and Mining Graph Data. Advances in Database Systems, Vol. 40. Springer."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"e_1_3_2_2_3_1","article-title":"The past, present and future of the German Record Linkage Center","volume":"239","author":"Antoni Manfred","year":"2017","unstructured":"Manfred Antoni and Rainer Schnell . 2017 . The past, present and future of the German Record Linkage Center . Journal of Economics and Statistics , Vol. 239 , 2 (2017). Manfred Antoni and Rainer Schnell. 2017. The past, present and future of the German Record Linkage Center. Journal of Economics and Statistics, Vol. 239, 2 (2017).","journal-title":"Journal of Economics and Statistics"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_2_5_1","volume-title":"Graph Theory","author":"Bondy Adrian","unstructured":"Adrian Bondy and Uppaluri Murty . 2011. Graph Theory . Springer , London . Adrian Bondy and Uppaluri Murty. 2011. Graph Theory. Springer, London."},{"key":"e_1_3_2_2_6_1","volume-title":"Medical Data Privacy Handbook","author":"Boyd James H","unstructured":"James H Boyd , Sean M Randall , and Anna M Ferrante . 2015. Application of Privacy-Preserving Techniques in Operational Record Linkage Centres . In Medical Data Privacy Handbook . Springer , 267--287. James H Boyd, Sean M Randall, and Anna M Ferrante. 2015. Application of Privacy-Preserving Techniques in Operational Record Linkage Centres. In Medical Data Privacy Handbook. Springer, 267--287."},{"key":"e_1_3_2_2_7_1","volume-title":"Data matching -- Concepts and techniques for record linkage, entity resolution, and duplicate detection","author":"Christen Peter","unstructured":"Peter Christen . 2012. Data matching -- Concepts and techniques for record linkage, entity resolution, and duplicate detection . Springer . Peter Christen. 2012. Data matching -- Concepts and techniques for record linkage, entity resolution, and duplicate detection. Springer."},{"key":"e_1_3_2_2_8_1","first-page":"2164","article-title":"Precise and Fast Cryptanalysis for Bloom Filter Based Privacy-Preserving Record Linkage","volume":"31","author":"Christen Peter","year":"2019","unstructured":"Peter Christen , Thilina Ranbaduge , Dinusha Vatsalan , and Rainer Schnell . 2019 . Precise and Fast Cryptanalysis for Bloom Filter Based Privacy-Preserving Record Linkage . IEEE TKDE , Vol. 31 , 11 (2019), 2164 -- 2177 . Peter Christen, Thilina Ranbaduge, Dinusha Vatsalan, and Rainer Schnell. 2019. Precise and Fast Cryptanalysis for Bloom Filter Based Privacy-Preserving Record Linkage. IEEE TKDE, Vol. 31, 11 (2019), 2164--2177.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_2_9_1","unstructured":"Chris Culnane Benjamin Rubinstein and Vanessa Teague. 2017. Vulnerabilities in the use of similarity tables in combination with pseudonymisation to preserve data privacy in the UK Office for National Statistics' Privacy-Preserving Record Linkage. arXiv Preprint (2017).  Chris Culnane Benjamin Rubinstein and Vanessa Teague. 2017. Vulnerabilities in the use of similarity tables in combination with pseudonymisation to preserve data privacy in the UK Office for National Statistics' Privacy-Preserving Record Linkage. arXiv Preprint (2017)."},{"key":"e_1_3_2_2_10_1","first-page":"2956","article-title":"Composite Bloom filters for secure record linkage","volume":"26","author":"Durham Elizabeth","year":"2014","unstructured":"Elizabeth Durham , Murat Kantarcioglu , Yuan Xue , Csaba Toth , Mehmet Kuzu , and Bradley Malin . 2014 . Composite Bloom filters for secure record linkage . IEEE TKDE , Vol. 26 , 12 (2014), 2956 -- 2968 . Elizabeth Durham, Murat Kantarcioglu, Yuan Xue, Csaba Toth, Mehmet Kuzu, and Bradley Malin. 2014. Composite Bloom filters for secure record linkage. IEEE TKDE, Vol. 26, 12 (2014), 2956--2968.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.01.074"},{"key":"e_1_3_2_2_12_1","volume-title":"DPM\/CBT@ESORICS","author":"Franke Martin","unstructured":"Martin Franke , Ziad Sehili , Marcel Gladbach , and Erhard Rahm . 2018. Post-processing Methods for High Quality Privacy-Preserving Record Linkage . In DPM\/CBT@ESORICS . Springer , Cham , 263--278. Martin Franke, Ziad Sehili, Marcel Gladbach, and Erhard Rahm. 2018. Post-processing Methods for High Quality Privacy-Preserving Record Linkage. In DPM\/CBT@ESORICS. Springer, Cham, 263--278."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_2_2_14_1","volume-title":"KDD","author":"Grover Aditya","unstructured":"Aditya Grover and Jure Leskovec . 2016. Node2vec: Scalable Feature Learning for Networks . In KDD . ACM , New York, NY, USA , 855--864. Aditya Grover and Jure Leskovec. 2016. Node2vec: Scalable Feature Learning for Networks. In KDD. ACM, New York, NY, USA, 855--864."},{"key":"e_1_3_2_2_15_1","volume-title":"PAKDD.","author":"Heimann Mark","unstructured":"Mark Heimann , Wei Lee , Shengjie Pan , Kuan-Yu Chen , and Danai Koutra . 2018a. HashAlign: Hash-Based Alignment of Multiple Graphs . In PAKDD. Melbourne . Mark Heimann, Wei Lee, Shengjie Pan, Kuan-Yu Chen, and Danai Koutra. 2018a. HashAlign: Hash-Based Alignment of Multiple Graphs. In PAKDD. Melbourne."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271788"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0195-3"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Martin Kroll and Simone Steinmetzer. 2015. Who Is 1011011111...1110110010? Automated cryptanalysis of Bloom filter encryptions of databases with several personal identifiers. In BIOSTEC. Springer Lisbon 341--356.  Martin Kroll and Simone Steinmetzer. 2015. Who Is 1011011111...1110110010? Automated cryptanalysis of Bloom filter encryptions of databases with several personal identifiers. In BIOSTEC. Springer Lisbon 341--356.","DOI":"10.1007\/978-3-319-27707-3_21"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_2_2_20_1","volume-title":"A constraint satisfaction cryptanalysis of Bloom filters in private record linkage","author":"Kuzu Mehmet","unstructured":"Mehmet Kuzu , Murat Kantarcioglu , Elizabeth Durham , and Bradley Malin . 2011. A constraint satisfaction cryptanalysis of Bloom filters in private record linkage . In PET. Springer , Waterloo , 226--245. Mehmet Kuzu, Murat Kantarcioglu, Elizabeth Durham, and Bradley Malin. 2011. A constraint satisfaction cryptanalysis of Bloom filters in private record linkage. In PET. Springer, Waterloo, 226--245."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJBDI.2017.086956"},{"key":"e_1_3_2_2_22_1","volume-title":"Probability and computing: Randomized algorithms and probabilistic analysis","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Eli Upfal . 2005. Probability and computing: Randomized algorithms and probabilistic analysis . Cambridge University Press . Michael Mitzenmacher and Eli Upfal. 2005. Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge University Press."},{"key":"e_1_3_2_2_23_1","volume-title":"Introduction to Linear Regression Analysis 5 ed.)","author":"Montgomery Douglas","unstructured":"Douglas Montgomery , Elizabeth Peck , and Geoffrey Vining . 2012. Introduction to Linear Regression Analysis 5 ed.) . Wiley . Douglas Montgomery, Elizabeth Peck, and Geoffrey Vining. 2012. Introduction to Linear Regression Analysis 5 ed.). Wiley."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v6i2.640"},{"key":"e_1_3_2_2_26_1","first-page":"346","article-title":"On the accuracy and scalability of probabilistic data linkage over the Brazilian 114 million cohort","volume":"22","author":"Pita Robespierre","year":"2018","unstructured":"Robespierre Pita , Cl'icia Pinto , Samila Sena , Rosemeire Fiaccone , Leila Amorim , Sandra Reis , Mauricio Barreto , Spiros Denaxas , and Marcos Ennes Barreto . 2018 . On the accuracy and scalability of probabilistic data linkage over the Brazilian 114 million cohort . IEEE JBHI , Vol. 22 , 2 (2018), 346 -- 353 . Robespierre Pita, Cl'icia Pinto, Samila Sena, Rosemeire Fiaccone, Leila Amorim, Sandra Reis, Mauricio Barreto, Spiros Denaxas, and Marcos Ennes Barreto. 2018. On the accuracy and scalability of probabilistic data linkage over the Brazilian 114 million cohort. IEEE JBHI, Vol. 22, 2 (2018), 346--353.","journal-title":"IEEE JBHI"},{"key":"e_1_3_2_2_27_1","volume-title":"Secure and Accurate Two-sep Hash Encoding for Privacy-Preserving Record Linkage","author":"Ranbaduge Thilina","unstructured":"Thilina Ranbaduge , Peter Christen , and Rainer Schnell . 2020. Secure and Accurate Two-sep Hash Encoding for Privacy-Preserving Record Linkage . In PAKDD. Springer , Singapore , 139--151. Thilina Ranbaduge, Peter Christen, and Rainer Schnell. 2020. Secure and Accurate Two-sep Hash Encoding for Privacy-Preserving Record Linkage. In PAKDD. Springer, Singapore, 139--151."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2013.12.003"},{"key":"e_1_3_2_2_29_1","volume-title":"Applied cryptography: Protocols, algorithms, and source code in C 2 ed.)","author":"Schneier Bruce","unstructured":"Bruce Schneier . 1996. Applied cryptography: Protocols, algorithms, and source code in C 2 ed.) . John Wiley and Sons, Inc. , New York . Bruce Schneier. 1996. Applied cryptography: Protocols, algorithms, and source code in C 2 ed.). John Wiley and Sons, Inc., New York."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-9-41"},{"key":"e_1_3_2_2_31_1","volume-title":"A Novel Error-Tolerant Anonymous Linking Code. SSRN Electronic Journal (01","author":"Schnell Rainer","year":"2011","unstructured":"Rainer Schnell , Tobias Bachteler , and J\u00f6rg Reiher . 2011. A Novel Error-Tolerant Anonymous Linking Code. SSRN Electronic Journal (01 2011 ). Rainer Schnell, Tobias Bachteler, and J\u00f6rg Reiher. 2011. A Novel Error-Tolerant Anonymous Linking Code. SSRN Electronic Journal (01 2011)."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Rainer Schnell and Christian Borgs. 2016a. Randomized response and balanced Bloom filters for privacy preserving record linkage. In ICDMW DINA. Barcelona.  Rainer Schnell and Christian Borgs. 2016a. Randomized response and balanced Bloom filters for privacy preserving record linkage. In ICDMW DINA. Barcelona.","DOI":"10.1109\/ICDMW.2016.0038"},{"key":"e_1_3_2_2_33_1","volume-title":"XOR-Folding for Bloom Filter-based Encryptions for Privacy-preserving Record Linkage. SSRN","author":"Schnell Rainer","year":"2016","unstructured":"Rainer Schnell and Christian Borgs . 2016b. XOR-Folding for Bloom Filter-based Encryptions for Privacy-preserving Record Linkage. SSRN ( 2016 ). Rainer Schnell and Christian Borgs. 2016b. XOR-Folding for Bloom Filter-based Encryptions for Privacy-preserving Record Linkage. SSRN (2016)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2017.01.002"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.11.005"},{"key":"e_1_3_2_2_36_1","volume-title":"Efficient Pattern Mining Based Cryptanalysis for Privacy-Preserving Record Linkage","author":"Vidanage Anushka","unstructured":"Anushka Vidanage , Thilina Ranbaduge , Peter Christen , and Rainer Schnell . 2019. Efficient Pattern Mining Based Cryptanalysis for Privacy-Preserving Record Linkage . In IEEE ICDE. IEEE , Macau , 1698--1701. Anushka Vidanage, Thilina Ranbaduge, Peter Christen, and Rainer Schnell. 2019. Efficient Pattern Mining Based Cryptanalysis for Privacy-Preserving Record Linkage. In IEEE ICDE. IEEE, Macau, 1698--1701."}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Ireland","acronym":"CIKM '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3411931","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3411931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:22Z","timestamp":1750197682000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3411931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":35,"alternative-id":["10.1145\/3340531.3411931","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3411931","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}