{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T01:06:19Z","timestamp":1766883979625,"version":"3.48.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030661717"},{"type":"electronic","value":"9783030661724"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-66172-4_3","type":"book-chapter","created":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T14:02:53Z","timestamp":1609164173000},"page":"35-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["P-Signature-Based Blocking to Improve the Scalability of Privacy-Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Dinusha","family":"Vatsalan","sequence":"first","affiliation":[]},{"given":"Joyce","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Brian","family":"Thorne","sequence":"additional","affiliation":[]},{"given":"Wilko","family":"Henecka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,29]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Al-Lawati, A., Lee, D., McDaniel, P.: Blocking-aware private record linkage. In: IQIS, pp. 59\u201368 (2005)","key":"3_CR1","DOI":"10.1145\/1077501.1077513"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1109\/TCBB.2018.2855125","volume":"16","author":"D Baker","year":"2018","unstructured":"Baker, D., et al.: Privacy-preserving linkage of genomic and clinical data sets. Trans. Comput. Biol. Bioinform. 16, 1342\u20131348 (2018)","journal-title":"Trans. Comput. Biol. Bioinform."},{"key":"3_CR3","series-title":"Data-Centric Systems and Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data Matching","author":"P Christen","year":"2012","unstructured":"Christen, P.: Data Matching. Data-Centric Systems and Applications. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31164-2"},{"issue":"9","key":"3_CR4","first-page":"1537","volume":"24","author":"P Christen","year":"2012","unstructured":"Christen, P.: A survey of indexing techniques for scalable record linkage and deduplication. IEEE TKDE 24(9), 1537\u20131555 (2012)","journal-title":"IEEE TKDE"},{"unstructured":"Cohen, W.W., Ravikumar, P., Fienberg, S.: A comparison of string distance metrics for name-matching tasks. In: IJCAI Workshop on Information Integration on the Web, pp. 73\u201378 (2003)","key":"3_CR5"},{"issue":"10","key":"3_CR6","doi-asserted-by":"publisher","first-page":"504","DOI":"10.5694\/j.1326-5377.2004.tb06052.x","volume":"180","author":"JR Condon","year":"2004","unstructured":"Condon, J.R., Barnes, T., Cunningham, J., Armstrong, B.K.: Long-term trends in cancer mortality for indigenous Australians in the northern territory. Med. J. Aust. 180(10), 504 (2004)","journal-title":"Med. J. Aust."},{"unstructured":"Durham, E.A.: A framework for accurate, efficient private record linkage. Ph.D. thesis, Vanderbilt University, Nashville, TN (2012)","key":"3_CR7"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s41019-017-0041-5","volume":"2","author":"S Han","year":"2017","unstructured":"Han, S., Shen, D., Nie, T., Kou, Y., Yu, G.: Private blocking technique for multi-party privacy-preserving record linkage. Data Sci. Eng. 2(2), 187\u2013196 (2017). https:\/\/doi.org\/10.1007\/s41019-017-0041-5","journal-title":"Data Sci. Eng."},{"doi-asserted-by":"crossref","unstructured":"He, X., Machanavajjhala, A., Flynn, C., Srivastava, D.: Composing differential privacy and secure computation: a case study on scaling private record linkage. In: ACM CCS, pp. 1389\u20131406 (2017)","key":"3_CR9","DOI":"10.1145\/3133956.3134030"},{"doi-asserted-by":"crossref","unstructured":"Karakasidis, A., Verykios, V.S.: Reference table based k-anonymous private blocking. In: ACM SAC, Riva del Garda, pp. 859\u2013864 (2012)","key":"3_CR10","DOI":"10.1145\/2245276.2245444"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1007\/s10115-016-0919-y","volume":"49","author":"D Karapiperis","year":"2016","unstructured":"Karapiperis, D., Verykios, V.S.: A fast and efficient Hamming LSH-based scheme for accurate linkage. Knowl. Inf. Syst. 49(3), 861\u2013884 (2016). https:\/\/doi.org\/10.1007\/s10115-016-0919-y","journal-title":"Knowl. Inf. Syst."},{"doi-asserted-by":"crossref","unstructured":"Kim, H., Lee, D.: HARRA: fast iterative hashed record linkage for large-scale data collections. In: EDBT, Lausanne, Switzerland, pp. 525\u2013536 (2010)","key":"3_CR12","DOI":"10.1145\/1739041.1739104"},{"doi-asserted-by":"crossref","unstructured":"Kuehni, C.E., et al. and Swiss Paediatric Oncology Group (SPOG): Cohort profile: the Swiss childhood cancer survivor study. Int. J. Epidemiol. 41(6), 1553\u20131564 (2011)","key":"3_CR13","DOI":"10.1093\/ije\/dyr142"},{"doi-asserted-by":"crossref","unstructured":"Kuzu, M., Kantarcioglu, M., Inan, A., Bertino, E., Durham, E., Malin, B.: Efficient privacy-aware record integration. In: ACM EDBT, Genoa, pp. 167\u2013178 (2013)","key":"3_CR14","DOI":"10.1145\/2452376.2452398"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-319-31750-2_33","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T Ranbaduge","year":"2016","unstructured":"Ranbaduge, T., Vatsalan, D., Christen, P., Verykios, V.: Hashing-based distributed multi-party blocking for privacy-preserving record linkage. In: Bailey, J., Khan, L., Washio, T., Dobbie, G., Huang, J.Z., Wang, R. (eds.) PAKDD 2016. LNCS (LNAI), vol. 9652, pp. 415\u2013427. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31750-2_33"},{"doi-asserted-by":"crossref","unstructured":"Schnell, R.: Privacy-preserving record linkage. In: Methodological Developments in Data Linkage, pp. 201\u2013225 (2015)","key":"3_CR16","DOI":"10.1002\/9781119072454.ch9"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1109\/TKDE.2011.232","volume":"25","author":"T Tassa","year":"2011","unstructured":"Tassa, T., Cohen, D.J.: Anonymization of centralized and distributed social networks by sequential clustering. IEEE Trans. Knowl. Data Eng. 25(2), 311\u2013324 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Tran, K.N., Vatsalan, D., Christen, P.: GeCo: an online personal data generator and corruptor. In: ACM Conference in Knowledge Management (CIKM), San Francisco, pp. 2473\u20132476 (2013)","key":"3_CR18","DOI":"10.1145\/2505515.2508207"},{"issue":"5","key":"3_CR19","first-page":"253","volume":"17","author":"S Trepetin","year":"2008","unstructured":"Trepetin, S.: Privacy-preserving string comparisons in record linkage systems: a review. Inf. Secur. J.: Global Perspect. 17(5), 253\u2013266 (2008)","journal-title":"Inf. Secur. J.: Global Perspect."},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-37456-2_29","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"D Vatsalan","year":"2013","unstructured":"Vatsalan, D., Christen, P.: Sorted nearest neighborhood clustering for efficient private blocking. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013. LNCS (LNAI), vol. 7819, pp. 341\u2013352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37456-2_29"},{"issue":"1","key":"3_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.S.: An evaluation framework for privacy-preserving record linkage. JPC 6(1), 35\u201375 (2014)","journal-title":"JPC"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"101809","DOI":"10.1016\/j.datak.2020.101809","volume":"128","author":"D Vatsalan","year":"2020","unstructured":"Vatsalan, D., Christen, P., Rahm, E.: Incremental clustering techniques for multi-party privacy-preserving record linkage. Data Knowl. Eng. 128, 101809 (2020)","journal-title":"Data Knowl. Eng."},{"doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P., Verykios, V.S.: Efficient two-party private blocking based on sorted nearest neighborhood clustering. In: ACM CIKM, San Francisco, pp. 1949\u20131958 (2013)","key":"3_CR23","DOI":"10.1145\/2505515.2505757"},{"doi-asserted-by":"crossref","unstructured":"Zhang, Y., Ng, K.S., Churchill, T., Christen, P.: Scalable entity resolution using probabilistic signatures on parallel databases. In: ACM CIKM, Turin, Italy, pp. 2213\u20132221 (2018)","key":"3_CR24","DOI":"10.1145\/3269206.3272016"}],"container-title":["Lecture Notes in Computer Science","Data Privacy Management, Cryptocurrencies and Blockchain Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-66172-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T01:01:25Z","timestamp":1766883685000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-66172-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030661717","9783030661724"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66172-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 December 2020","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":"Guildford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"17 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dpm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/deic-web.uab.cat\/conferences\/dpm\/dpm2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","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":"12","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":"5","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":"32% - 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","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":"3","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}