{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:52:21Z","timestamp":1742982741775,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811366604"},{"type":"electronic","value":"9789811366611"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-13-6661-1_15","type":"book-chapter","created":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T10:58:46Z","timestamp":1550228326000},"page":"189-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reference Values Based Hardening for Bloom Filters Based Privacy-Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Sirintra","family":"Vaiwsri","sequence":"first","affiliation":[]},{"given":"Thilina","family":"Ranbaduge","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Christen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,16]]},"reference":[{"issue":"2","key":"15_CR1","first-page":"4","volume":"2018","author":"M Alaggan","year":"2018","unstructured":"Alaggan, M., Cunche, M., Gambs, S.: Privacy-preserving Wi-Fi analytics. PET 2018(2), 4\u201326 (2018)","journal-title":"PET"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-33536-5_20","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Alaggan","year":"2012","unstructured":"Alaggan, M., Gambs, S., Kermarrec, A.-M.: BLIP: non-interactive differentially-private similarity computation on Bloom filters. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 202\u2013216. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33536-5_20"},{"issue":"7","key":"15_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B Bloom","year":"1970","unstructured":"Bloom, B.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-23633-9_11","volume-title":"Medical Data Privacy Handbook","author":"JH Boyd","year":"2015","unstructured":"Boyd, J.H., Randall, S.M., Ferrante, A.M.: Application of privacy-preserving techniques in operational record linkage centres. In: Gkoulalas-Divanis, A., Loukides, G. (eds.) Medical Data Privacy Handbook, pp. 267\u2013287. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23633-9_11"},{"key":"15_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection","author":"P Christen","year":"2012","unstructured":"Christen, P.: Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31164-2"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-319-57454-7_49","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P Christen","year":"2017","unstructured":"Christen, P., Schnell, R., Vatsalan, D., Ranbaduge, T.: Efficient cryptanalysis of Bloom filters for privacy-preserving record linkage. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017, Part I. LNCS (LNAI), vol. 10234, pp. 628\u2013640. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57454-7_49"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-319-93040-4_42","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P Christen","year":"2018","unstructured":"Christen, P., Vidanage, A., Ranbaduge, T., Schnell, R.: Pattern-mining based cryptanalysis of Bloom filters for privacy-preserving record linkage. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018, Part III. LNCS (LNAI), vol. 10939, pp. 530\u2013542. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93040-4_42"},{"issue":"12","key":"15_CR8","first-page":"2956","volume":"26","author":"E Durham","year":"2014","unstructured":"Durham, E., Kantarcioglu, M., Xue, Y., Toth, C., Kuzu, M., Malin, B.: Composite Bloom filters for secure record linkage. IEEE TKDE 26(12), 2956\u20132968 (2014)","journal-title":"IEEE TKDE"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part II. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Erlingsson, \u00da., Pihur, V., Korolova, A.: Rappor: randomized aggregatable privacy-preserving ordinal response. In: ACM SIGSAC (2014)","DOI":"10.1145\/2660267.2660348"},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s11222-017-9746-6","volume":"28","author":"D Hand","year":"2018","unstructured":"Hand, D., Christen, P.: A note on using the F-measure for evaluating record linkage algorithms. Stat. Comput. 28(3), 539\u2013547 (2018)","journal-title":"Stat. Comput."},{"key":"15_CR12","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-27707-3_21","volume-title":"Biomedical Engineering Systems and Technologies","author":"M Kroll","year":"2015","unstructured":"Kroll, M., Steinmetzer, S.: Who is 1011011111 $$\\ldots $$ 1110110010? Automated cryptanalysis of Bloom filter encryptions of databases with several personal identifiers. In: Fred, A., Gamboa, H., Elias, D. (eds.) BIOSTEC 2015. CCIS, vol. 574, pp. 341\u2013356. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27707-3_21"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-22263-4_13","volume-title":"Privacy Enhancing Technologies","author":"M Kuzu","year":"2011","unstructured":"Kuzu, M., Kantarcioglu, M., Durham, E., Malin, B.: A constraint satisfaction cryptanalysis of Bloom filters in private record linkage. In: Fischer-H\u00fcbner, S., Hopper, N. (eds.) PETS 2011. LNCS, vol. 6794, pp. 226\u2013245. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22263-4_13"},{"key":"15_CR14","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-00179-6_5","volume-title":"Intelligent Patient Management","author":"C Pang","year":"2009","unstructured":"Pang, C., Gu, L., Hansen, D., Maeder, A.: Privacy-preserving fuzzy matching using a public reference table. In: McClean, S., Millard, P., El-Darzi, E., Nugent, C. (eds.) Intelligent Patient Management. SCI, vol. 189, pp. 71\u201389. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00179-6_5"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1186\/1472-6947-9-41","volume":"9","author":"R Schnell","year":"2009","unstructured":"Schnell, R., Bachteler, T., Reiher, J.: Privacy-preserving record linkage using Bloom filters. BMC Med. Inform. Decis. Mak. 9(1), 41 (2009)","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Schnell, R., Borgs, C.: Randomized response and balanced Bloom filters for privacy preserving record linkage. In: ICDMW DINA (2016)","DOI":"10.1109\/ICDMW.2016.0038"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Schnell, R.: Privacy-preserving record linkage. In: Harron, K., Goldstein, H., Dibben, C. (eds.) Methodological Developments in Data Linkage (2015)","DOI":"10.1002\/9781119072454.ch9"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Schnell, R., Borgs, C.: XOR-folding for Bloom filter-based encryptions for privacy-preserving record linkage. Working paper, German Record Linkage Center (2016)","DOI":"10.2139\/ssrn.3527984"},{"key":"15_CR19","unstructured":"Schnell, R., Rukasz, D., Borgs, C., Brumme, S., et al.: R PPRL toolbox (2018). https:\/\/cran.r-project.org\/web\/packages\/PPRL\/"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/978-3-319-49340-4_25","volume-title":"Handbook of Big Data Technologies","author":"D Vatsalan","year":"2017","unstructured":"Vatsalan, D., Sehili, Z., Christen, P., Rahm, E.: Privacy-preserving record linkage for big data: current approaches and research challenges. In: Zomaya, A.Y., Sakr, S. (eds.) Handbook of Big Data Technologies, pp. 851\u2013895. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-49340-4_25"},{"issue":"1","key":"15_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.29012\/jpc.v6i1.636","volume":"6","author":"D Vatsalan","year":"2014","unstructured":"Vatsalan, D., Christen, P., O\u2019Keefe, C.M., Verykios, V.: An evaluation framework for privacy-preserving record linkage. JPC 6(1), 35\u201375 (2014)","journal-title":"JPC"}],"container-title":["Communications in Computer and Information Science","Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-6661-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T22:04:58Z","timestamp":1606514698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-6661-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811366604","9789811366611"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-6661-1_15","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AusDM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bathurst, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausdm2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ausdm18.ausdm.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}