arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.13880cs.CR
收藏

肾脏交换问题的高效隐私保护近似求解

Efficient Privacy-Preserving Approximation of the Kidney Exchange Problem

Malte Breuer, Ulrike Meyer, Susanne Wetzel

AI总结:

针对现有肾脏交换问题隐私保护协议因NP完全性缺乏可扩展性的问题,提出通用且数据无关的高效近似隐私保护协议,经真实数据集验证性能更优。

摘要:

肾脏交换问题(KEP)旨在在患者与其不相容肾脏捐献者组成的配对之间寻找可行的交换方案,同时满足特定优化标准,例如最大化可实现移植的总数量。近年来,已有多项用于求解KEP的隐私保护协议被提出。但由于KEP是一个NP完全问题,目前已知的协议在实际应用中缺乏可扩展性。我们针对这一问题提出了一种新型隐私保护协议,该协议可计算KEP的近似解,能够很好地适配实际场景中大量患者-捐献者配对的规模。与此前隐私保护肾脏交换领域的研究不同,我们的协议在可采用的安全模型方面具有通用性。与目前现存最高效的肾脏交换隐私保护协议相比,我们的协议完全是数据无关的,且运行时间性能优异得多。作为第二项贡献,我们使用一个真实世界数据集模拟了该协议在肾脏交换平台中的应用——该平台中患者-捐献者配对会随时间注册和注销,进而确定其在真实场景中的近似质量。

英文摘要:

The kidney exchange problem (KEP) seeks to find possible exchanges among pairs of patients and their incompatible kidney donors while meeting specific optimization criteria such as maximizing the overall number of possible transplants. Recently, several privacy-preserving protocols for solving the KEP have been proposed. However, the protocols known to date lack scalability in practice since the KEP is an NP-complete problem. We address this issue by proposing a novel privacy-preserving protocol which computes an approximate solution for the KEP that scales well for the large numbers of patient-donor pairs encountered in practice. As opposed to prior work on privacy-preserving kidney exchange, our protocol is generic w.r.t.\ the security model that can be employed. Compared to the most efficient privacy-preserving protocols for kidney exchange existing to date, our protocol is entirely data oblivious and it exhibits a far superior run time performance. As a second contribution, we use a real-world data set to simulate the application of our protocol as part of a kidney exchange platform, where patient-donor pairs register and de-register over time, and thereby determine its approximation quality in a real-world setting.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑