{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:25:11Z","timestamp":1770229511278,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031541285","type":"print"},{"value":"9783031541292","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-54129-2_34","type":"book-chapter","created":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T22:03:15Z","timestamp":1710194595000},"page":"569-584","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Verifiable Fairness: Privacy\u2013preserving Computation of\u00a0Fairness for\u00a0Machine Learning Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5172-2957","authenticated-orcid":false,"given":"Ehsan","family":"Toreini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4223-6885","authenticated-orcid":false,"given":"Maryam","family":"Mehrnezhad","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7233-6943","authenticated-orcid":false,"given":"Aad","family":"van Moorsel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10115-017-1116-3","volume":"54","author":"P Adler","year":"2018","unstructured":"Adler, P., et al.: Auditing black-box models for indirect influence. Knowl. Inf. Syst. 54(1), 95\u2013122 (2018)","journal-title":"Knowl. Inf. Syst."},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Angelino, E., Larus-Stone, N., Alabi, D., Seltzer, M., Rudin, C.: Learning certifiably optimal rule lists for categorical data. arXiv preprint arXiv:1704.01701 (2017)","DOI":"10.1145\/3097983.3098047"},{"issue":"4","key":"34_CR3","doi-asserted-by":"publisher","first-page":"5878","DOI":"10.1109\/JIOT.2018.2880839","volume":"6","author":"MA Azad","year":"2018","unstructured":"Azad, M.A., Bag, S., Parkinson, S., Hao, F.: TrustVote: privacy-preserving node ranking in vehicular networks. IEEE Internet Things J. 6(4), 5878\u20135891 (2018)","journal-title":"IEEE Internet Things J."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Baudron, O., Fouque, P.A., Pointcheval, D., Stern, J., Poupard, G.: Practical multi-candidate election system. In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, pp. 274\u2013283 (2001)","DOI":"10.1145\/383962.384044"},{"issue":"2","key":"34_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1089\/big.2016.0047","volume":"5","author":"A Chouldechova","year":"2017","unstructured":"Chouldechova, A.: Fair prediction with disparate impact: a study of bias in recidivism prediction instruments. Big Data 5(2), 153\u2013163 (2017)","journal-title":"Big Data"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Corbett-Davies, S., Pierson, E., Feller, A., Goel, S., Huq, A.: Algorithmic decision making and the cost of fairness. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 797\u2013806. ACM (2017)","DOI":"10.1145\/3097983.3098095"},{"key":"34_CR7","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) Annual International Cryptology Conference, vol. 839, pp. 174\u2013187. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_19","DOI":"10.1007\/3-540-48658-5_19"},{"issue":"2","key":"34_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10551-019-04228-2","volume":"163","author":"CE Carroll","year":"2020","unstructured":"Carroll, C.E., Olegario, R.: Pathways to corporate accountability: corporate reputation and its alternatives. J. Bus. Ethics 163(2), 173\u2013181 (2020)","journal-title":"J. Bus. Ethics"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, M., Friedler, S.A., Moeller, J., Scheidegger, C., Venkatasubramanian, S.: Certifying and removing disparate impact. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 259\u2013268. ACM (2015)","DOI":"10.1145\/2783258.2783311"},{"key":"34_CR10","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Conference on the Theory and Application of Cryptographic Techniques, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"34_CR11","unstructured":"Friedler, S.A., Scheidegger, C., Venkatasubramanian, S.: On the (im) possibility of fairness. arXiv preprint arXiv:1609.07236 (2016)"},{"issue":"5","key":"34_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3236009","volume":"51","author":"R Guidotti","year":"2018","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., Pedreschi, D.: A survey of methods for explaining black box models. ACM Comput. Surv. (CSUR) 51(5), 1\u201342 (2018)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"34_CR13","unstructured":"Hao, F., Kreeger, M.N., Randell, B., Clarke, D., Shahandashti, S.F., Lee, P.H.J.: Every vote counts: Ensuring integrity in large-scale electronic voting. In: 2014 Electronic Voting Technology Workshop\/Workshop on Trustworthy Elections (EVT\/WOTE 14) (2014)"},{"issue":"2","key":"34_CR14","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1049\/iet-ifs.2008.0127","volume":"4","author":"F Hao","year":"2010","unstructured":"Hao, F., Ryan, P.Y.A., Zieli\u0144ski, P.: Anonymous voting by two-round public discussion. IET Inf. Secur. 4(2), 62\u201367 (2010)","journal-title":"IET Inf. Secur."},{"key":"34_CR15","first-page":"3315","volume":"29","author":"M Hardt","year":"2016","unstructured":"Hardt, M., Price, E., Srebro, N., et al.: Equality of opportunity in supervised learning. Adv. Neural Inf. Process. Syst. 29, 3315\u20133323 (2016)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Hu, H., Liu, Y., Wang, Z., Lan, C.: A distributed fair machine learning framework with private demographic data protection. In: 2019 IEEE International Conference on Data Mining (ICDM), pp. 1102\u20131107. IEEE (2019)","DOI":"10.1109\/ICDM.2019.00131"},{"key":"34_CR17","unstructured":"Jagielski, M., et al.: Differentially private fair learning. In: International Conference on Machine Learning, pp. 3000\u20133008. PMLR (2019)"},{"key":"34_CR18","doi-asserted-by":"publisher","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2014","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. CRC Press, Boca Raton (2014)"},{"key":"34_CR19","unstructured":"Kilbertus, N., Gascon, A., Kusner, M., Veale, M., Gummadi, K.P., Weller, A.: Blind justice: Fairness with encrypted sensitive attributes. In: 35th International Conference on Machine Learning, pp. 2630\u20132639. PMLR (2018)"},{"issue":"1","key":"34_CR20","first-page":"2016","volume":"9","author":"J Larson","year":"2016","unstructured":"Larson, J., Mattu, S., Kirchner, L., Angwin, J.: How we analyzed the COMPAS recidivism algorithm. ProPublica 9(1), 2016 (2016)","journal-title":"ProPublica"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Liu, J., Yu, F., Song, L.: A systematic investigation on the research publications that have used the medical expenditure panel survey (MEPS) data through a bibliometrics approach. Library Hi Tech (2020)","DOI":"10.1108\/LHT-09-2019-0185"},{"key":"34_CR22","first-page":"1","volume":"30","author":"SM Lundberg","year":"2017","unstructured":"Lundberg, S.M., Lee, S.I.: A unified approach to interpreting model predictions. Adv. Neural Inf. Process. Syst. 30, 1\u201310 (2017)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"34_CR23","unstructured":"Mahdawi, A.: It\u2019s not just A-levels - algorithms have a nightmarish new power over our lives. The Guardian (2020)"},{"key":"34_CR24","unstructured":"Narayanan, A.: Translation tutorial: 21 fairness definitions and their politics. In Proceedings of Conference on Fairness Accountability Transport, New York, USA (2018)"},{"issue":"5","key":"34_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102657","volume":"58","author":"C Panigutti","year":"2021","unstructured":"Panigutti, C., Perotti, A., Panisson, A., Bajardi, P., Pedreschi, D.: Fairlens: auditing black-box clinical decision support systems. Inf. Process. Manag. 58(5), 102657 (2021)","journal-title":"Inf. Process. Manag."},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Panigutti, C., Perotti, A., Pedreschi, D.: Doctor xai: an ontology-based approach to black-box sequential data classification explanations. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, pp. 629\u2013639 (2020)","DOI":"10.1145\/3351095.3372855"},{"key":"34_CR27","doi-asserted-by":"crossref","unstructured":"Park, S., Kim, S., Lim, Y.: Fairness audit of machine learning models with confidential computing. In: Proceedings of the ACM Web Conference 2022, pp. 3488\u20133499 (2022)","DOI":"10.1145\/3485447.3512244"},{"key":"34_CR28","unstructured":"Reuters. Amazon ditched AI recruiting tool that favored men for technical jobs. The Guardian (2018)"},{"key":"34_CR29","doi-asserted-by":"crossref","unstructured":"Segal, S., Adi, Y., Pinkas, B., Baum, C., Ganesh, C., Keshet, J.: Fairness in the eyes of the data: certifying machine-learning models. In: Proceedings of the 2021 AAAI\/ACM Conference on AI, Ethics, and Society, pp. 926\u2013935 (2021)","DOI":"10.1145\/3461702.3462554"},{"issue":"2","key":"34_CR30","first-page":"47","volume":"31","author":"K Siau","year":"2018","unstructured":"Siau, K., Wang, W.: Building trust in artificial intelligence, machine learning, and robotics. Cutter Bus. Technol. J. 31(2), 47\u201353 (2018)","journal-title":"Cutter Bus. Technol. J."},{"key":"34_CR31","doi-asserted-by":"publisher","DOI":"10.1201\/9781315282497","volume-title":"Cryptography: Theory and Practice","author":"DR Stinson","year":"2018","unstructured":"Stinson, D.R., Paterson, M.: Cryptography: Theory and Practice. CRC Press, Boca Raton (2018)"},{"key":"34_CR32","doi-asserted-by":"crossref","unstructured":"Toreini, E., Aitken, M., Coopamootoo, K., Elliott, K., Zelaya, C.G., van Moorsel, A.: The relationship between trust in AI and trustworthy machine learning technologies. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, pp. 272\u2013283 (2020)","DOI":"10.1145\/3351095.3372834"},{"issue":"2","key":"34_CR33","doi-asserted-by":"publisher","first-page":"205395171774353","DOI":"10.1177\/2053951717743530","volume":"4","author":"M Veale","year":"2017","unstructured":"Veale, M., Binns, R.: Fairer machine learning in the real world: mitigating discrimination without collecting sensitive data. Big Data Soc. 4(2), 2053951717743530 (2017)","journal-title":"Big Data Soc."},{"issue":"1","key":"34_CR34","first-page":"2357","volume":"18","author":"T Wang","year":"2017","unstructured":"Wang, T., Rudin, C., Doshi-Velez, F., Liu, Y., Klampfl, E., MacNeille, P.: A bayesian framework for learning rule sets for interpretable classification. J. Mach. Learn. Res. 18(1), 2357\u20132393 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"34_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3298981","volume":"10","author":"Q Yang","year":"2019","unstructured":"Yang, Q., Liu, Y., Chen, T., Tong, Y.: Federated machine learning: concept and applications. ACM Trans. Intell. Syst. Technol. (TIST) 10(2), 1\u201319 (2019)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"}],"container-title":["Lecture Notes in Computer Science","Computer Security. ESORICS 2023 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54129-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T22:07:55Z","timestamp":1710194875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54129-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031541285","9783031541292"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54129-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Hague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"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":"478","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":"93","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":"19% - 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":"10","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}