{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T07:14:13Z","timestamp":1774509253161,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030474355","type":"print"},{"value":"9783030474362","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-47436-2_11","type":"book-chapter","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T07:02:47Z","timestamp":1588921367000},"page":"139-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Secure and Accurate Two-Step Hash Encoding for Privacy-Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Thilina","family":"Ranbaduge","sequence":"first","affiliation":[]},{"given":"Peter","family":"Christen","sequence":"additional","affiliation":[]},{"given":"Rainer","family":"Schnell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"11_CR1","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31164-2"},{"issue":"11","key":"11_CR2","first-page":"2164","volume":"31","author":"P Christen","year":"2018","unstructured":"Christen, P., Ranbaduge, T., Vatsalan, D., Schnell, R.: Precise and fast cryptanalysis for Bloom filter based privacy-preserving record linkage. IEEE TKDE 31(11), 2164\u20132177 (2018)","journal-title":"IEEE TKDE"},{"issue":"3","key":"11_CR3","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). \nhttps:\/\/doi.org\/10.1007\/s11222-017-9746-6","journal-title":"Stat. Comput."},{"key":"11_CR4","doi-asserted-by":"publisher","DOI":"10.1515\/9781501506062","volume-title":"Random Number Generators - Principles and Practices: A Guide for Engineers and Programmers","author":"D Johnston","year":"2018","unstructured":"Johnston, D.: Random Number Generators - Principles and Practices: A Guide for Engineers and Programmers. Walter de Gruyter GmbH & Co, Berlin (2018)"},{"issue":"4","key":"11_CR5","first-page":"909","volume":"27","author":"D Karapiperis","year":"2014","unstructured":"Karapiperis, D., Verykios, V.: An LSH-based blocking approach with a homomorphic matching technique for privacy-preserving record linkage. IEEE TKDE 27(4), 909\u2013921 (2014)","journal-title":"IEEE TKDE"},{"key":"11_CR6","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22263-4_13"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1146\/annurev-soc-073117-041447","volume":"44","author":"S Ruggles","year":"2018","unstructured":"Ruggles, S., Fitch, C.A., Roberts, E.: Historical census record linkage. Ann. Rev. Sociol. 44, 19\u201337 (2018)","journal-title":"Ann. Rev. Sociol."},{"key":"11_CR8","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, 41 (2009). \nhttps:\/\/doi.org\/10.1186\/1472-6947-9-41","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Schnell, R., Borgs, C.: Randomized response and balanced Bloom filters for privacy preserving record linkage. In: ICDMW, Barcelona, pp. 218\u2013224 (2016)","DOI":"10.1109\/ICDMW.2016.0038"},{"issue":"3","key":"11_CR10","first-page":"263","volume":"30","author":"R Schnell","year":"2014","unstructured":"Schnell, R.: An efficient privacy-preserving record linkage technique for administrative data and censuses. Stat. J. IAOS 30(3), 263\u2013270 (2014)","journal-title":"Stat. J. IAOS"},{"key":"11_CR11","first-page":"271","volume":"34","author":"D Smith","year":"2017","unstructured":"Smith, D.: Secure pseudonymisation for privacy-preserving probabilistic record linkage. J. Inf. Secur. Appl. 34, 271\u2013279 (2017)","journal-title":"J. Inf. Secur. Appl."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/11927587_5","volume-title":"Information Security and Cryptology \u2013 ICISC 2006","author":"K Suzuki","year":"2006","unstructured":"Suzuki, K., Tonien, D., Kurosawa, K., Toyota, K.: Birthday paradox for multi-collisions. In: Rhee, M.S., Lee, B. (eds.) ICISC 2006. LNCS, vol. 4296, pp. 29\u201340. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11927587_5"},{"key":"11_CR13","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-49340-4_25"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Vidanage, A., Ranbaduge, T., Christen, P., Schnell, R.: Efficient pattern mining based cryptanalysis for privacy-preserving record linkage. In: IEEE ICDE, Macau, pp. 1698\u20131701 (2019)","DOI":"10.1109\/ICDE.2019.00176"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-47436-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T08:04:28Z","timestamp":1588925068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-47436-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030474355","9783030474362"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-47436-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pakdd2020.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"628","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"135","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6-8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}