A Study of Secure Multi-party Ranking Problem

Abstract

In this paper, we study a secure multi-party ranking problem: there are n parties, P 1 , P 2 , ..., P n . Each party P i has a secret input m i ∈ {1, 2, ..., N }. He wants to get the order of m i in the ascending ranking sequence of the n parties' inputs, while not leaking the value of m i . This problem extends the famous Yao's Millionaires' problem form two paries to n parties and is a multi-party Yao's Millionaires' problem. We propose a protocol for solving the secure multi-party ranking problem, using the encoding scheme and the El Gamal cryptosystem. We also prove the correctness and the security of our solution in the semihonest model. The solution of secure multi-party ranking problem can make new-style electronic transactions, such as private biding and auction, secret online transaction and so on, become better security.

Research on Secure Multi-party Ranking Problem and Secure Selection Problem

“…We make an experiment to compare SMRP with the protocol of Wen Liu [10]. We mainly consider the operation time of the two protocols.…”

“…After that, many special protocols were proposed for SMC [6][7][8][9]. So this paper investigates a specific SMC problem which is called Secure Multi-Party Ranking problem (SMR) [10]. It is extended from Yao' Millionaires' problem [11].…”

“…It also discusses the complexity and correctness of this protocol. The computation complexity of this protocol is O(n 2 Nd), the communication complexity is O(n 2 N).We compare the performance of this protocol with [10], when d<logp, the communication complexity of this protocol is better than [10], and when n<logp, the computation complexity is also better than [10].…”

“…In section 3 and section 4 two protocols are respectively proposed for SMR and SMS. In section 5, we compare SMRP with the protocol of Wen Liu [10] by experiment. Section 6 is the conclusion.…”

A Privacy-Preserving Platform for User-Centric Quantitative Benchmarking

“…Those issues can be tackled with SMC protocols. Numerous variants have been proposed in the last decades, among them generic ones [3][4][5][6] as well as protocols tailored for specific scenarios [7][8][9]. The work by Kerschbaum et al [10][11][12] is especially focused on privacypreserving benchmarking between (mutually distrustful) organisations.…”