{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:42:32Z","timestamp":1757313752045,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030003043"},{"type":"electronic","value":"9783030003050"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-00305-0_19","type":"book-chapter","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T10:55:57Z","timestamp":1536231357000},"page":"263-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Post-processing Methods for High Quality Privacy-Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Martin","family":"Franke","sequence":"first","affiliation":[]},{"given":"Ziad","family":"Sehili","sequence":"additional","affiliation":[]},{"given":"Marcel","family":"Gladbach","sequence":"additional","affiliation":[]},{"given":"Erhard","family":"Rahm","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,7]]},"reference":[{"issue":"7","key":"19_CR1","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. CACM 13(7), 422\u2013426 (1970)","journal-title":"CACM"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., de Melo, G., Naumann, F., Weikum, G.: LINDA: distributed web-of-data-scale entity matching. In: ACM CIKM, pp. 2104\u20132108 (2012)","DOI":"10.1145\/2396761.2398582"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1186\/s12911-017-0478-5","volume":"17","author":"AP Brown","year":"2017","unstructured":"Brown, A.P., Borgs, C., Randall, S.M., Schnell, R.: Evaluating privacy-preserving record linkage using cryptographic long-term keys and multibit trees on large medical datasets. BMC Med. Inf. Decis. Making 17(1), 83 (2017)","journal-title":"BMC Med. Inf. Decis. Making"},{"key":"19_CR4","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":"19_CR5","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. LNCS (LNAI), vol. 10234, pp. 628\u2013640. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57454-7_49"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Christen, P., Vatsalan, D.: Flexible and extensible generation and corruption of personal data. In: ACM CIKM, pp. 1165\u20131168 (2013)","DOI":"10.1145\/2505515.2507815"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Do, H.H., Rahm, E.: COMA - a system for flexible combination of schema matching approaches. In: VLDB, pp. 610\u2013621 (2002)","DOI":"10.1016\/B978-155860869-6\/50060-3"},{"key":"19_CR8","unstructured":"Durham, E.A.: A framework for accurate, efficient private record linkage. Ph.D. thesis, Vanderbilt University (2012)"},{"issue":"1","key":"19_CR9","first-page":"1","volume":"19","author":"AK Elmagarmid","year":"2007","unstructured":"Elmagarmid, A.K., Ipeirotis, P.G., Verykios, V.S.: Duplicate record detection: a survey. IEEE TKDE 19(1), 1\u201316 (2007)","journal-title":"IEEE TKDE"},{"issue":"328","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1080\/01621459.1969.10501049","volume":"64","author":"IP Fellegi","year":"1969","unstructured":"Fellegi, I.P., Sunter, A.B.: A theory for record linkage. JASA 64(328), 1183\u20131210 (1969)","journal-title":"JASA"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Franke, M., Sehili, Z., Rahm, E.: Parallel privacy preserving record linkage using LSH-based blocking. In: IoTBDS, pp. 195\u2013203 (2018)","DOI":"10.5220\/0006682701950203"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1186\/s12885-016-2322-1","volume":"16","author":"A Gibberd","year":"2016","unstructured":"Gibberd, A., Supramaniam, R., Dillon, A., Armstrong, B.K., OConnell, D.L.: Lung cancer treatment and mortality for Aboriginal people in New South Wales, Australia: results from a population-based record linkage study and medical record audit. BMC Cancer 16(1), 289 (2016)","journal-title":"BMC Cancer"},{"key":"19_CR14","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1009761603038","volume":"2","author":"MA Hern\u00e1ndez","year":"1998","unstructured":"Hern\u00e1ndez, M.A., Stolfo, S.J.: Real-world data is dirty: data cleansing and the merge\/purge problem. Data Min. Knowl. Discovery 2(1), 9\u201337 (1998)","journal-title":"Data Min. Knowl. Discovery"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discrete Appl. Math. 48(3), 261\u2013272 (1994)","journal-title":"Discrete Appl. Math."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Iwama, K., Miyazaki, S.: A survey of the stable marriage problem and its variants. In: IEEE ICKS, pp. 131\u2013136 (2008)","DOI":"10.1109\/ICKS.2008.7"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1111\/j.1469-8137.1912.tb05611.x","volume":"11","author":"P Jaccard","year":"1912","unstructured":"Jaccard, P.: The distribution of the flora in the alpine zone. New Phytol. 11(2), 37\u201350 (1912)","journal-title":"New Phytol."},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Karapiperis, D., Gkoulalas-Divanis, A., Verykios, V.S.: Distance-aware encoding of numerical values for privacy-preserving record linkage. In: IEEE ICDE, pp. 135\u2013138 (2017)","DOI":"10.1109\/ICDE.2017.58"},{"issue":"2","key":"19_CR20","first-page":"292","volume":"30","author":"D Karapiperis","year":"2018","unstructured":"Karapiperis, D., Gkoulalas-Divanis, A., Verykios, V.S.: FEDERAL: a framework for distance-aware privacy-preserving record linkage. IEEE TKDE 30(2), 292\u2013304 (2018)","journal-title":"IEEE TKDE"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Karapiperis, D., Verykios, V.S.: A distributed framework for scaling up LSH-based computations in privacy preserving record linkage. In: Proceedings of the BCI (2013)","DOI":"10.1145\/2490257.2490258"},{"issue":"3","key":"19_CR22","first-page":"861","volume":"49","author":"D Karapiperis","year":"2016","unstructured":"Karapiperis, D., Verykios, V.S.: A fast and efficient hamming LSH-based scheme for accurate linkage. KAIS 49(3), 861\u2013884 (2016)","journal-title":"KAIS"},{"issue":"5","key":"19_CR23","first-page":"1072","volume":"22","author":"AN Kho","year":"2015","unstructured":"Kho, A.N., Cashy, J.P., Jackson, K.L., Pah, A.R., Goel, S., Boehnke, J., Humphries, J.E., Kominers, S.D., Hota, B.N., Sims, S.A., et al.: Design and implementation of a privacy preserving electronic health record linkage tool in Chicago. JAMIA 22(5), 1072\u20131080 (2015)","journal-title":"JAMIA"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Kroll, M., Steinmetzer, S.: Automated cryptanalysis of bloom filter encryptions of health records. In: ICHI (2014)","DOI":"10.5220\/0005176000050013"},{"issue":"6","key":"19_CR25","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1093\/ije\/dyr142","volume":"41","author":"CE Kuehni","year":"2012","unstructured":"Kuehni, C.E., et al.: Cohort profile: the Swiss childhood cancer survivor study. Int. J. Epidemiol. 41(6), 1553\u20131564 (2012)","journal-title":"Int. J. Epidemiol."},{"key":"19_CR26","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"},{"issue":"2","key":"19_CR27","first-page":"285","volume":"20","author":"M Kuzu","year":"2013","unstructured":"Kuzu, M., Kantarcioglu, M., Durham, E.A., Toth, C., Malin, B.: A practical approach to achieve private medical record linkage in light of public resources. JAMIA 20(2), 285\u2013292 (2013)","journal-title":"JAMIA"},{"issue":"4","key":"19_CR28","first-page":"681","volume":"22","author":"R Lenz","year":"2006","unstructured":"Lenz, R.: Measuring the disclosure protection of micro aggregated business microdata: an analysis taking as an example the German structure of costs survey. J. Official Stat. 22(4), 681 (2006)","journal-title":"J. Official Stat."},{"issue":"1","key":"19_CR29","doi-asserted-by":"publisher","first-page":"e014259","DOI":"10.1136\/bmjopen-2016-014259","volume":"7","author":"Q Luo","year":"2017","unstructured":"Luo, Q., et al.: Cancer-related hospitalisations and unknownstage prostate cancer: a population-based record linkage study. BMJ Open 7(1), e014259 (2017)","journal-title":"BMJ Open"},{"key":"19_CR30","unstructured":"Marie, A., Gal, A.: On the Stable Marriage of Maximum Weight Royal Couples. In: AAAI Workshop on Information Integration on the Web (2007)"},{"issue":"3","key":"19_CR31","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01934199","volume":"10","author":"DG McVitie","year":"1970","unstructured":"McVitie, D.G., Wilson, L.B.: Stable marriage assignment for unequal sets. BIT Numer. Math. 10(3), 295\u2013309 (1970)","journal-title":"BIT Numer. Math."},{"key":"19_CR32","unstructured":"Meilicke, C., Stuckenschmidt, H.: Analyzing mapping extraction approaches. In: OM, pp. 25\u201336 (2007)"},{"key":"19_CR33","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: a versatile graph matching algorithm and its application to schema matching. In: IEEE ICDE, pp. 117\u2013128 (2002)"},{"issue":"1","key":"19_CR34","first-page":"32","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. SIAM J. 5(1), 32\u201338 (1957)","journal-title":"SIAM J."},{"issue":"2","key":"19_CR35","doi-asserted-by":"publisher","first-page":"59","DOI":"10.29012\/jpc.v6i2.640","volume":"6","author":"F Niedermeyer","year":"2014","unstructured":"Niedermeyer, F., Steinmetzer, S., Kroll, M., Schnell, R.: Cryptanalysis of basic bloom filters used for privacy preserving record linkage. JPC 6(2), 59\u201379 (2014)","journal-title":"JPC"},{"issue":"4","key":"19_CR36","first-page":"3","volume":"23","author":"E Rahm","year":"2000","unstructured":"Rahm, E., Do, H.H.: Data cleaning: problems and current approaches. IEEE Data Eng. Bull. 23(4), 3\u201313 (2000)","journal-title":"IEEE Data Eng. Bull."},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-319-93417-4_37","volume-title":"The Semantic Web","author":"A Saeedi","year":"2018","unstructured":"Saeedi, A., Peukert, E., Rahm, E.: Using link features for entity clustering in knowledge graphs. In: Gangemi, A., et al. (eds.) ESWC 2018. LNCS, vol. 10843, pp. 576\u2013592. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93417-4_37"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"Schnell, R.: Privacy-preserving record linkage. In: Methodological Developments in Data Linkage, pp. 201\u2013225 (2015)","DOI":"10.1002\/9781119072454.ch9"},{"issue":"1","key":"19_CR39","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. Inf. Decis. Making 9(1), 41 (2009)","journal-title":"BMC Med. Inf. Decis. Making"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"Schnell, R., Bachteler, T., Reiher, J.: A novel error-tolerant anonymous linking code. GRLC, No. WP-GRLC-2011-02 (2011)","DOI":"10.2139\/ssrn.3549247"},{"key":"19_CR41","doi-asserted-by":"crossref","unstructured":"Schnell, R., Borgs, C.: Randomized response and balanced bloom filters for privacy preserving record linkage. In: IEEE ICDMW (2016)","DOI":"10.1109\/ICDMW.2016.0038"},{"issue":"3","key":"19_CR42","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s13222-016-0222-9","volume":"16","author":"Z Sehili","year":"2016","unstructured":"Sehili, Z., Rahm, E.: Speeding up privacy preserving record linkage for metric space similarity measures. Datenbank-Spektrum 16(3), 227\u2013236 (2016)","journal-title":"Datenbank-Spektrum"},{"issue":"6","key":"19_CR43","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1016\/j.is.2012.11.005","volume":"38","author":"D Vatsalan","year":"2013","unstructured":"Vatsalan, D., Christen, P., Verykios, V.S.: A taxonomy of privacy-preserving record linkage techniques. Inf. Syst. 38(6), 946\u2013969 (2013)","journal-title":"Inf. Syst."},{"key":"19_CR44","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P.: scalable privacy-preserving record linkage for multiple databases. In: ACM CIKM, pp. 1795\u20131798 (2014)","DOI":"10.1145\/2661829.2661875"},{"key":"19_CR45","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.jbi.2015.12.004","volume":"59","author":"D Vatsalan","year":"2016","unstructured":"Vatsalan, D., Christen, P.: Privacy-preserving matching of similar patients. J. Biomed. Inf. 59, 285\u2013298 (2016)","journal-title":"J. Biomed. Inf."},{"issue":"1","key":"19_CR46","doi-asserted-by":"publisher","first-page":"3","DOI":"10.29012\/jpc.v6i1.636","volume":"6","author":"D Vatsalan","year":"2014","unstructured":"Vatsalan, D., Christen, P., O\u2019Keefe, C.M., Verykios, V.S.: An evaluation framework for privacy-preserving record linkage. JPC 6(1), 3 (2014)","journal-title":"JPC"},{"key":"19_CR47","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"},{"key":"19_CR48","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B., et al.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)"}],"container-title":["Lecture Notes in Computer Science","Data Privacy Management, Cryptocurrencies and Blockchain Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00305-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T02:52:39Z","timestamp":1604890359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00305-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030003043","9783030003050"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00305-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DPM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Data Privacy Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"6 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dpm2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}