{"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":1766883979834,"version":"3.48.0"},"publisher-location":"Cham","reference-count":26,"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_1","type":"book-chapter","created":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T14:02:53Z","timestamp":1609164173000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fairness-Aware Privacy-Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Dinusha","family":"Vatsalan","sequence":"first","affiliation":[]},{"given":"Joyce","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Wilko","family":"Henecka","sequence":"additional","affiliation":[]},{"given":"Brian","family":"Thorne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,29]]},"reference":[{"key":"1_CR1","unstructured":"Agarwal, A., Beygelzimer, A., Dud\u00edk, M., Langford, J., Wallach, H.: A reductions approach to fair classification. arXiv preprint arXiv:1803.02453 (2018)"},{"key":"1_CR2","first-page":"1","volume":"81","author":"R Binns","year":"2018","unstructured":"Binns, R.: Fairness in machine learning: lessons from political philosophy. J. Mach. Learn. Res. 81, 1\u201311 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJDS.2019.098358","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), 1\u201316 (2019)","journal-title":"Int. J. Popul. Data Sci."},{"key":"1_CR4","series-title":"Data-Centric Systems and Applications","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. Data-Centric Systems and Applications. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31164-2"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Dankar, F., El Emam, K.: A method for evaluating marketer re-identification risk. In: EDBT Workshops, No. 28, Lausanne (2010)","DOI":"10.1145\/1754239.1754271"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1515\/popets-2015-0007","volume":"2015","author":"A Datta","year":"2015","unstructured":"Datta, A., Tschantz, M.C., Datta, A.: Automated experiments on ad privacy settings. Proc. Priv. Enhanc. Technol. 2015(1), 92\u2013112 (2015)","journal-title":"Proc. Priv. Enhanc. Technol."},{"key":"1_CR7","unstructured":"Durham, E.A.: A framework for accurate, efficient private record linkage. Ph.D. thesis, Vanderbilt University, Nashville, TN (2012)"},{"key":"1_CR8","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. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Dwork, C., Hardt, M., Pitassi, T., Reingold, O., Zemel, R.: Fairness through awareness. In: Innovations in Theoretical Computer Science Conference, pp. 214\u2013226. ACM (2012)","DOI":"10.1145\/2090236.2090255"},{"key":"1_CR10","unstructured":"Dwork, C., Immorlica, N., Kalai, A.T., Leiserson, M.: Decoupled classifiers for group-fair and efficient machine learning. In: Conference on Fairness, Accountability and Transparency, pp. 119\u2013133 (2018)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Fish, B., Kun, J., Lelkes, \u00c1.D.: A confidence-based approach for balancing fairness and accuracy. In: SIAM International Conference on Data Mining, pp. 144\u2013152. SIAM (2016)","DOI":"10.1137\/1.9781611974348.17"},{"key":"1_CR12","unstructured":"Flores, A.W., Bechtel, K., Lowenkamp, C.T.: False positives, false negatives, and false analyses: a rejoinder to machine bias: there\u2019s software used across the country to predict future criminals. And it\u2019s biased against blacks. Fed. Probation 80, 38 (2016)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Krasanakis, E., Spyromitros-Xioufis, E., Papadopoulos, S., Kompatsiaris, Y.: Adaptive sensitive reweighting to mitigate bias in fairness-aware classification. In: World Wide Web Conference, pp. 853\u2013862 (2018)","DOI":"10.1145\/3178876.3186133"},{"issue":"2","key":"1_CR14","first-page":"212","volume":"21","author":"HC Kum","year":"2014","unstructured":"Kum, H.C., Krishnamurthy, A., Machanavajjhala, A., Reiter, M.K., Ahalt, S.: Privacy preserving interactive record linkage (PPIRL). JAMIA 21(2), 212\u2013220 (2014)","journal-title":"JAMIA"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B.: Secure multiparty computation for privacy-preserving data mining. J. Priv. Confidentiality (1) (2009)","DOI":"10.29012\/jpc.v1i1.566"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00262ED1V01Y201003DTM003","volume":"2","author":"F Naumann","year":"2010","unstructured":"Naumann, F., Herschel, M.: An introduction to duplicate detection. Synth. Lect. Data Manag. 2(1), 1\u201387 (2010)","journal-title":"Synth. Lect. Data Manag."},{"issue":"1","key":"1_CR17","first-page":"1","volume":"50","author":"SM Randall","year":"2014","unstructured":"Randall, S.M., Ferrante, A.M., Boyd, J.H., Semmens, J.B.: Privacy-preserving record linkage on large real world datasets. J. Biomed. Inform. 50(1), 1 (2014)","journal-title":"J. Biomed. Inform."},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/9781119072454.ch9","volume-title":"Methodological Developments in Data Linkage","author":"R Schnell","year":"2016","unstructured":"Schnell, R.: Privacy preserving record linkage. In: Harron, K., Goldstein, H., Dibben, C. (eds.) Methodological Developments in Data Linkage, pp. 201\u2013225. Wiley, Chichester (2016)"},{"key":"1_CR19","unstructured":"Snoek, J., Larochelle, H., Adams, R.P.: Practical Bayesian optimization of machine learning algorithms. In: Advances in Neural Information Processing Systems, pp. 2951\u20132959 (2012)"},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/2460276.2460278","volume":"11","author":"L Sweeney","year":"2013","unstructured":"Sweeney, L.: Discrimination in online ad delivery. Queue 11(3), 10\u201329 (2013)","journal-title":"Queue"},{"key":"1_CR21","unstructured":"Ustun, B., Liu, Y., Parkes, D.: Fairness without harm: decoupled classifiers with preference guarantees. In: International Conference on Machine Learning, pp. 6373\u20136382 (2019)"},{"issue":"6","key":"1_CR22","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":"1_CR23","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":"1_CR24","doi-asserted-by":"crossref","unstructured":"Verma, S., Rubin, J.: Fairness definitions explained. In: International Workshop on Software Fairness (FairWare), pp. 1\u20137. IEEE (2018)","DOI":"10.1145\/3194770.3194776"},{"key":"1_CR25","unstructured":"Zafar, M.B., Valera, I., Rodriguez, M.G., Gummadi, K.P.: Fairness constraints: mechanisms for fair classification. In: International Conference on Artificial Intelligence and Statistics, Florida, USA (2017)"},{"key":"1_CR26","unstructured":"Zemel, R., Wu, Y., Swersky, K., Pitassi, T., Dwork, C.: Learning fair representations. In: International Conference on Machine Learning, pp. 325\u2013333 (2013)"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T01:01:28Z","timestamp":1766883688000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-66172-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030661717","9783030661724"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66172-4_1","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"}]}}