星型网络中k阶元素的安全计算
Secure Computation of the kth-Ranked Element in a Star Network
摘要：
我们考虑的问题，安全地计算的k-排名的元素在一个序列中的n个私人整数分布在n个缔约方。排名第k的元素（例如，最小值、最大值、中位数）在基准测试中特别有意义，它使公司能够将自己的关键业绩指标与同行的统计数据进行比较。单个整数是敏感数据，而排名第k的元素是各方共同感兴趣的。以前的安全计算协议的第k排名的元素需要每对当事人之间的通信信道。它们不能扩展到大量的缔约方，因为它们是高度互动的，导致更长的延迟。此外，它们很难部署，因为每对当事人之间需要特殊的安排来建立安全连接。服务器模型自然适合Internet应用程序的客户端-服务器体系结构，其中客户端连接到服务器，而不是连接到其他客户端。它可以通过减少轮数来简化安全计算，从而提高其性能和可扩展性。在这个模型中，只有每个客户端和服务器之间有通信通道，而只有客户端向计算提供输入。因此，它是一种集中式通信模式，即，明星网络。我们提出了不同的方法来私下计算服务器模型中的第k位元素，使用乱码电路或阈值同态加密。我们的方案具有恒定的轮数，并且可以在几秒钟内为WAN中的多达50个客户端计算第k个排名的元素。
英文摘要：
We consider the problem of securely computing the kth-ranked element in a sequence of n private integers distributed among n parties. The kth-ranked element (e.g., minimum, maximum, median) is of particular interest in benchmarking, which allows a company to compare its own key performance indicator to the statistics of its peer group. The individual integers are sensitive data, yet the kth-ranked element is of mutual interest to the parties. Previous secure computation protocols for the kth-ranked element require a communication channel between each pair of parties. They do not scale to a large number of parties as they are highly interactive resulting in longer delays. Moreover, they are difficult to deploy as special arrangements are required between each pair of parties to establish a secure connection. A server model naturally fits with the client-server architecture of Internet applications in which clients are connected to the server and not to other clients. It can simplify secure computation by reducing the number of rounds, and as a result, improve its performance and scalability. In this model, there are communication channels only between each client and the server, while only clients provide inputs to the computation. Hence, it is a centralized communication pattern, i.e., a star network. We propose different approaches for privately computing the kth-ranked element in the server model, using either garbled circuits or threshold homomorphic encryption. Our schemes have a constant number of rounds and can compute the kth-ranked element within seconds for up to 50 clients in a WAN.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
