SPIKE: secure and private investigation of the kidney exchange problem

被引:4
作者
Birka, Timm [1 ]
Hamacher, Kay [2 ]
Kussel, Tobias [2 ]
Mollering, Helen [1 ]
Schneider, Thomas [1 ]
机构
[1] Tech Univ Darmstadt, ENCRYPTO, Darmstadt, Germany
[2] Tech Univ Darmstadt, Computat Biol & Simulat Grp, Darmstadt, Germany
基金
欧洲研究理事会;
关键词
Kidney-exchange; Privacy; Secure multi-party computation (MPC); BRANCHING PROGRAMS; GRAFT; HLA; TRANSPLANTATION; MISMATCH; SURVIVAL; CIRCUIT; WEIGHT; DEATH; RISK;
D O I
10.1186/s12911-022-01994-4
中图分类号
R-058 [];
学科分类号
摘要
Background: The kidney exchange problem (KEP) addresses the matching of patients in need for a replacement organ with compatible living donors. Ideally many medical institutions should participate in a matching program to increase the chance for successful matches. However, to fulfill legal requirements current systems use complicated policy-based data protection mechanisms that effectively exclude smaller medical facilities to participate. Employing secure multi-party computation (MPC) techniques provides a technical way to satisfy data protection requirements for highly sensitive personal health information while simultaneously reducing the regulatory burdens. Results: We have designed, implemented, and benchmarked SPIKE, a secure MPC-based privacy-preserving KEP protocol which computes a locally optimal solution by finding matching donor-recipient pairs in a graph structure. SPIKE matches 40 pairs in cycles of length 2 in less than 4 min and outperforms the previous state-of-the-art protocol by a factor of 400x in runtime while providing medically more robust solutions. Conclusions: We show how to solve the KEP in a robust and privacy-preserving manner achieving significantly more practical performance than the current state-of-the-art (Breuer et al., WPES'20 and CODASPY'22). The usage of MPC techniques fulfills many data protection requirements on a technical level, allowing smaller health care providers to directly participate in a kidney exchange with reduced legal processes. As sensitive data are not leaving the institutions' network boundaries, the patient data underlie a higher level of protection than in the currently employed (centralized) systems. Furthermore, due to reduced legal barriers, the proposed decentralized system might be simpler to implement in a transnational, intereuropean setting with mixed (national) data protecion laws.
引用
收藏
页数:21
相关论文
共 82 条
[1]  
Aas J, INTRO ISRG PRIO SERV
[2]  
Abraham DJ, ACM C ELECT COMMERCE
[3]  
[Anonymous], BLUTSPENDEN RUND UMS
[4]  
[Anonymous], 2018, EUROTRANSPLANT MANUA
[5]  
[Anonymous], 1986, 27 ANN S FDN COMP SC
[6]   Secure Graph Analysis at Scale [J].
Araki, Toshinori ;
Furukawa, Jun ;
Ohara, Kazuma ;
Pinkas, Benny ;
Rosemarin, Hanan ;
Tsuchida, Hikaru .
CCS '21: PROCEEDINGS OF THE 2021 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2021, :610-629
[7]   More Efficient Oblivious Transfer Extensions [J].
Asharov, Gilad ;
Lindell, Yehuda ;
Schneider, Thomas ;
Zohner, Michael .
JOURNAL OF CRYPTOLOGY, 2017, 30 (03) :805-858
[8]   A Kidney Graft Survival Calculator that Accounts for Mismatches in Age, Sex, HLA, and Body Size [J].
Ashby, Valarie B. ;
Leichtman, Alan B. ;
Rees, Michael A. ;
Song, Peter X. -K. ;
Bray, Mathieu ;
Wang, Wen ;
Kalbfleisch, John D. .
CLINICAL JOURNAL OF THE AMERICAN SOCIETY OF NEPHROLOGY, 2017, 12 (07) :1148-1160
[9]   Conflict graphs in solving integer programming problems [J].
Atamtürk, A ;
Nemhauser, GL ;
Savelsbergh, MWP .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 121 (01) :40-55
[10]   Crossing Anatomic Barriers-Transplantation of a Kidney with 5 Arteries, Duplication of the Pyelocalyceal System, and Double Ureter [J].
Bachul, Piotr J. ;
Osuch, Czeslaw ;
Chang, Ea-sle ;
Betkowska-Prokop, Alina ;
Pasternak, Artur ;
Szura, Miroslaw ;
Matyja, Andrzej ;
Walocha, Jerzy A. .
CELL TRANSPLANTATION, 2017, 26 (10) :1669-1672