Prioritization and exchange chains in privacy-preserving kidney exchange
-
Published:2024-02-05
Issue:
Volume:
Page:1-56
-
ISSN:1875-8924
-
Container-title:Journal of Computer Security
-
language:
-
Short-container-title:JCS
Author:
Breuer Malte1, Hein Pascal1, Pompe Leonardo1, Meyer Urike1, Wetzel Susanne2
Affiliation:
1. Department of Computer Science, RWTH Aachen University, Germany 2. Department of Computer Science, Stevens Institute of Technology, NJ, USA
Abstract
The Kidney Exchange Problem (KEP) aims at finding an optimal set of exchanges among pairs of patients and their medically incompatible living kidney donors as well as altruistic donors who are not associated with any particular patient but want to donate a kidney to any person in need. Existing platforms that offer the finding of such exchanges for patient-donor pairs and altruistic donors are organized in a centralized fashion and operated by a single platform operator. This makes them susceptible to manipulation and corruption. Recent research has targeted these security issues by proposing decentralized Secure Multi-Party Computation (SMPC) protocols for solving the KEP. However, these protocols fail to meet two important requirements for kidney exchange in practice. First, they do not allow for altruistic donors. While such donors are not legally allowed in all countries, they have been shown to have a positive effect on the number of transplants that can be found. Second, the existing SMPC protocols do not support prioritization, which is used in existing platforms to give priority to certain exchanges or patient-donor pairs, e.g., to patients who are hard to match due to their medical characteristics. In this paper, we introduce a generic gate for implementing prioritization in kidney exchange. We extend two existing SMPC protocols for solving the KEP such that they allow for altruistic donors and prioritization and present one novel SMPC protocol for solving the KEP with altruistic donors and prioritization based on dynamic programming. We prove the security of all protocols and analyze their complexity. We implement all protocols and evaluate their performance for the setting where altruistic donors are legally allowed and for the setting where they are not. Thereby, we determine the performance impact of the inclusion of altruistic donors and obtain those approaches that perform best for each setting.
Subject
Computer Networks and Communications,Hardware and Architecture,Safety, Risk, Reliability and Quality,Software
Reference29 articles.
1. T. Andersson, P. Biró, M. Calderön, P. Chromy, A.N. Costa, E. Cozzi, P. Delgado, P. Dworczak, P. Fiaschetti, M. Garcia, B. Haase-Kromwijk, A. Hemke, X. Klimentova, D. Kuypers, L. Lombardini, D. Manlove, W. Petterson, A. Rais, N. Santos, B. Smeulders, V. Sparacino, F. Spieksma, M. Valentín, J. van de Klundert, F. Vespasiano and A. Viana, Modelling and optimisation in European kidney exchange programmes, 2019, https://www.enckep-cost.eu/assets/content/156/enckep_wg1_handbook2-20210407142449-156.pdf. 2. T. Araki, J. Furukawa, Y. Lindell, A. Nof and K. Ohara, High-throughput semi-honest secure three-party computation with an honest majority, in: Computer and Communications Security, ACM, 2016. 3. T. Araki, J. Furukawa, K. Ohara, B. Pinkas, H. Rosemarin and H. Tsuchida, Secure graph analysis at scale, in: Computer and Communications Security, ACM, 2021. 4. I. Ashlagi, A. Bingaman, M. Burq, V. Manshadi, D. Gamarnik, C. Murphey, A.E. Roth, M.L. Melcher and M.A. Rees, Effect of match-run frequencies on the number of transplants and waiting times in kidney exchange, in: American Journal of Transplantation, Vol. 18, Wiley Online Library, 2018. 5. P. Biró, J. van de Klundert, D. Manlove, W. Pettersson, T. Andersson, L. Burnapp, P. Chromy, P. Delgado, P. Dworczak, B. Haase et al., Modelling and optimisation in European kidney exchange programmes, in: European Journal of Operational Research, Elsevier, 2019.
|
|