Secure Multi-party Sorting Protocol Based on Distributed Oblivious Transfer

In the present paper, a secure multi-party protocol for sorting the private values, without disclosing them, is presented. We extend the Yao’s millionaire problem to n parties. Secure comparison and sorting the wealth of n parties using the Yao’s protocol requires running it $\frac{{n \times (n - 2)}}{2}$ times. For a wealth interval of N, the complexity the Yao’s protocol execution for these n parties has an order of N × n2.The Secure Multi-party Computation method is utilized to develop the protocol of secure multi-party sorting. We also employ an easy knapsack problem to distinguish the corresponding indices of different participants. Moreover, a modified version of the distributed oblivious transfer protocol is proposed to improve our proposed protocol and reduce its overall compexity. The computational and communication complexities of our protocol for secure multi-party sorting based on the distributed oblivious transfer, are both equal to n. Finally, the security of the proposed protocol against adversaries of semi-honest type is proved.