Various information-theoretically secure Multi-Party Computation (MPC) schemes have been proposed over some finite field or some finite ring ℝ. A function f that can be evaluated on MPC is usually represented by boolean or arithmetic circuits. In general, the function class that have constant-depth arithmetic circuit is studied. Additionally, some literatures show that one can represent any formulas and branching program by low-degree randomizing polynomials, which can be evaluated in constant rounds. However, these approaches have their limitations, and it is not easy to construct the optimal branching program for a complex function. Therefore, it is not obvious how to efficiently perform oblivious sort in constant rounds, but oblivious sort is one of the most important primitive protocols for MPC in practice. In this paper, we are going to show several constant-round 0-error oblivious sorting algorithms, together with some useful applications. © 2011 Springer-Verlag.
CITATION STYLE
Zhang, B. (2011). Generic constant-round oblivious sorting algorithm for MPC. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6980 LNCS, pp. 240–256). https://doi.org/10.1007/978-3-642-24316-5_17
Mendeley helps you to discover research relevant for your work.