Loading [a11y]/accessibility-menu.js
Solving the Kidney Exchange Problem Using Privacy-Preserving Integer Programming | IEEE Conference Publication | IEEE Xplore

Solving the Kidney Exchange Problem Using Privacy-Preserving Integer Programming

Publisher: IEEE

Abstract:

The kidney exchange problem (KEP) seeks to determine a constellation of exchanges that maximizes the number of possible transplants between a set of patients and their in...View more

Abstract:

The kidney exchange problem (KEP) seeks to determine a constellation of exchanges that maximizes the number of possible transplants between a set of patients and their incompatible donors. Recently, Secure Multi-Party Computation (SMPC) techniques were used to devise privacy-preserving protocols that allow the solving of the KEP in a distributed fashion. However, these protocols lack sufficient performance in practice. In the non-privacy-preserving case, the most efficient algorithms solving the KEP are based on integer programming. It is in this context, that we propose a privacy-preserving protocol based on these integer programming techniques that efficiently solves the KEP in a privacy-preserving fashion. We prove the security of this protocol and analyze its complexity. Furthermore, we provide a comprehensive performance evaluation of an implementation of the protocol in the SMPC benchmarking framework MP-SPDZ.
Date of Conference: 22-24 August 2022
Date Added to IEEE Xplore: 18 August 2022
ISBN Information:
Publisher: IEEE
Conference Location: Fredericton, NB, Canada

Funding Agency:


I. Introduction

In living kidney donation, a patient tries to find a friend or relative who is willing to donate one of her kidneys to the patient. Even if a patient finds such a living donor, this donor is often not medically compatible with the patient. Kidney exchange tries to solve this problem by finding constellations in which multiple such incompatible patient-donor pairs can exchange their kidney donors among each other. These exchanges are usually carried out in exchange cycles where the donor of a patient-donor pair always donates to the patient of the succeeding pair in the cycle and the patient of a pair receives a kidney donation from the donor of the preceding pair. In practice, the maximum size of these exchange cycles is commonly restricted to two or three due to the amount of medical resources that are required to carry out a transplant [2].

References

References is not available for this document.