{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:52:19Z","timestamp":1742914339456,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031236891"},{"type":"electronic","value":"9783031236907"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-23690-7_3","type":"book-chapter","created":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T05:02:50Z","timestamp":1670648570000},"page":"44-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generating-Set Evaluation of\u00a0Bloom Filter Hardening Techniques in\u00a0Private Record Linkage"],"prefix":"10.1007","author":[{"given":"Karin","family":"Mortl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rinku","family":"Dewri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,11]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1109\/TCBB.2018.2855125","volume":"16","author":"DB Baker","year":"2019","unstructured":"Baker, D.B., Knoppers, B.M., Phillips, M., van Enckevort, D., Kaufmann, P., Lochmuller, H., Taruscio, D.: Privacy-preserving linkage of genomic and clinical data sets. IEEE\/ACM Trans. Comput. Biol. Bioinform. 16(4), 1342\u20131348 (2019)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"1","key":"3_CR2","first-page":"1095","volume":"4","author":"AP Brown","year":"2019","unstructured":"Brown, A.P., Randall, S.M., Boyd, J.H., Ferrante, A.M.: Evaluation of approximate comparison methods on Bloom filters for probabilistic linkage. Int. J. Popul. Data Sci. 4(1), 1095 (2019)","journal-title":"Int. J. Popul. Data Sci."},{"issue":"11","key":"3_CR3","doi-asserted-by":"publisher","first-page":"2164","DOI":"10.1109\/TKDE.2018.2874004","volume":"31","author":"P Christen","year":"2019","unstructured":"Christen, P., Ranbaduge, T., Vatsalan, D., Schnell, R.: Precise and fast cryptanalysis for Bloom filter based privacy-preserving record linkage. IEEE Trans. Knowl. Data Eng. 31(11), 2164\u20132177 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Christen, P., Schnell, R., Vatsalan, D., Ranbaduge, T.: Efficient cryptanalysis of Bloom filters for privacy-preserving record linkage. In: 2017 Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 628\u2013640 (2017)","DOI":"10.1007\/978-3-319-57454-7_49"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Churches, T., Christen, P.: Blind data linkage using n-gram similarity comparisons. In: 2004 Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 121\u2013126 (2004)","DOI":"10.1007\/978-3-540-24775-3_15"},{"issue":"3","key":"3_CR6","first-page":"4","volume":"2016","author":"R Dewri","year":"2016","unstructured":"Dewri, R., Ong, T., Thurimella, R.: Linking health records for federated query processing. Proc. Priv. Enhanc. Technol. 2016(3), 4\u201323 (2016)","journal-title":"Proc. Priv. Enhanc. Technol."},{"issue":"12","key":"3_CR7","doi-asserted-by":"publisher","first-page":"2956","DOI":"10.1109\/TKDE.2013.91","volume":"26","author":"EA Durham","year":"2014","unstructured":"Durham, E.A., Kantarcioglu, M., Xue, Y., Toth, C., Kuzu, M., Malin, B.: Composite bloom filters for secure record linkage. IEEE Trans. Knowl. Data Eng. 26(12), 2956\u20132968 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Erlingsson, U., Pihur, V., Korolova, A.: RAPPOR: randomized aggregatable privacy-preserving ordinal response. In: 2014 21st ACM Conference on Computer and Communications Security, pp. 1054\u20131067 (2014)","DOI":"10.1145\/2660267.2660348"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Franke, M., Sehili, Z., Rahm, E.: Parallel privacy-preserving record linkage using LSH-based blocking. In: 2018 3rd International Conference on Internet of Things, Big Data and Security, pp. 195\u2013203 (2018)","DOI":"10.5220\/0006682701950203"},{"key":"3_CR10","unstructured":"Franke, M., Sehili, Z., Rohde, F., Rahm, E.: Evaluation of hardening techniques for privacy-preserving record linkage. In: 2021 24th International Conference on Extending Database Technology, pp. 289\u2013300 (2021)"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1186\/s12911-016-0366-4","volume":"16","author":"M Guesdon","year":"2016","unstructured":"Guesdon, M., Benzenine, E., Gadouche, K., Quantin, C.: Securizing data linkage in French public statistics. BMC Med. Inform. Decis. Mak. 16(1), 129 (2016)","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Hall, R., Fienberg, S.E.: Privacy-preserving record linkage. In: 2010 International Conference on Privacy in Statistical Databases, pp. 269\u2013283 (2010)","DOI":"10.1007\/978-3-642-15838-4_24"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Karakasidis, A., Verykios, V.: Privacy preserving record linkage using phonetic codes. In: 2009 4th Balkan Conference in Informatics, pp. 101\u2013106 (2009)","DOI":"10.1109\/BCI.2009.29"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11841036_42","volume-title":"Algorithms \u2013 ESA 2006","author":"A Kirsch","year":"2006","unstructured":"Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: building a better bloom filter. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 456\u2013467. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841036_42"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Kroll, M., Steinmetzer, S.: Automated cryptanalysis of bloom filter encryptions of health records. In: German Record Linkage Center, Working Paper Series. No. WP-GRLC-2014-05 (2014)","DOI":"10.2139\/ssrn.3530864"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Kuzu, M., Kantarcioglu, M., Durham, E., Malin, B.: A constraint satisfaction cryptanalysis of Bloom filters in private record linkage. In: Privacy Enhancing Technologies, pp. 226\u2013245 (2011)","DOI":"10.1007\/978-3-642-22263-4_13"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Lazrig, I., Ong, T.C., Ray, I., Ray, I., Jiang, X., Vaidya, J.: Privacy preserving probabilistic record linkage without trusted third party. In: 2018 16th Annual Conference on Privacy, Security and Trust, pp. 1\u201310 (2018)","DOI":"10.1109\/PST.2018.8514192"},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1504\/IJBDI.2017.086956","volume":"4","author":"W Mitchell","year":"2017","unstructured":"Mitchell, W., Dewri, R., Thurimella, R., Roschke, M.: A graph traversal attack on Bloom filter-based medical data aggregation. Int. J. Big Data Intell. 4(4), 217\u2013226 (2017)","journal-title":"Int. J. Big Data Intell."},{"issue":"2","key":"3_CR19","first-page":"59","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. J. Priv. Confid. 6(2), 59\u201379 (2014)","journal-title":"J. Priv. Confid."},{"key":"3_CR20","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":"3_CR21","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.: Privacy-preserving record linkage using Bloom filters. BMC Med. Inform. Decis. Mak. 9(1), 41 (2009)","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"3_CR22","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3549247","author":"R Schnell","year":"2011","unstructured":"Schnell, R., Bachteler, T., Reiher, J.: A novel error-tolerant anonymous linking code. SSRN Electron. J. (2011). https:\/\/doi.org\/10.2139\/ssrn.3549247","journal-title":"SSRN Electron. J."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Schnell, R., Borgs, C.: Randomized response and balanced Bloom filters for privacy preserving record linkage. In: 2016 16th International Conference on Data Mining Workshops, pp. 218\u2013224 (2016)","DOI":"10.1109\/ICDMW.2016.0038"},{"key":"3_CR24","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3527984","author":"R Schnell","year":"2016","unstructured":"Schnell, R., Borgs, C.: XOR-folding for Bloom filter-based encryptions for privacy-preserving record linkage. SSRN Electron. J. (2016). https:\/\/doi.org\/10.2139\/ssrn.3527984","journal-title":"SSRN Electron. J."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Schnell, R., Borgs, C.: Hardening encrypted patient names against cryptographic attacks using cellular automata. In: 2018 International Conference on Data Mining Workshops, pp. 518\u2013522 (2018)","DOI":"10.1109\/ICDMW.2018.00082"},{"key":"3_CR26","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":"3_CR27","doi-asserted-by":"crossref","unstructured":"Stammler, S., et al.: Mainzelliste SecureEpilinker (MainSEL): privacy-preserving record linkage using secure multi-party computation. Bioinformatics 38(6), 1657\u20131668 (2022)","DOI":"10.1093\/bioinformatics\/btaa764"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P., Rahm, E.: Scalable privacy-preserving linking of multiple databases using counting Bloom filters. In: 2016 16th International Conference on Data Mining Workshops, pp. 882\u2013889 (2016)","DOI":"10.1109\/ICDMW.2016.0130"},{"issue":"6","key":"3_CR29","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.: A taxonomy of privacy-preserving record linkage techniques. Inf. Sys. 38(6), 946\u2013969 (2013)","journal-title":"Inf. Sys."},{"key":"3_CR30","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":"3_CR31","doi-asserted-by":"crossref","unstructured":"Vidanage, A., Christen, P., Ranbaduge, T., Schnell, R.: A graph matching attack on privacy-preserving record linkage. In: 2020 29th ACM International Conference on Information & Knowledge Management, pp. 1485\u20131494 (2020)","DOI":"10.1145\/3340531.3411931"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Vidanage, A., Ranbaduge, T., Christen, P., Randall, S.: A privacy attack on multiple dynamic match-key based privacy-preserving record linkage. Int. J. Popul. Data Sci. 5(1) (2020)","DOI":"10.23889\/ijpds.v5i1.1345"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Vidanage, A., Ranbaduge, T., Christen, P., Schnell, R.: Efficient pattern mining based cryptanalysis for privacy-preserving record linkage. In: 2019 35th International Conference on Data Engineering, pp. 1698\u20131701 (2019)","DOI":"10.1109\/ICDE.2019.00176"}],"container-title":["Lecture Notes in Computer Science","Information Systems Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23690-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T05:03:32Z","timestamp":1670648612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23690-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031236891","9783031236907"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23690-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Systems Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tirupati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iciss2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icissconf.org\/","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":"55","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":"8","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":"15% - 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.5","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)"}}]}}