.png){kind=icon}
.png){kind=icon}
Return
A Privacy-Preserving Comparison Protocol
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2022.3215640.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The multiparty comparison allows to compare two integers x and y blindly, where a set of players hold the shares of the elements xandy , x , y is an element of F-p, a prime field. The existing multiparty comparison protocols execute in constant rounds, but the number of multiplications depends on the size of the prime p, i.e., the communication complexity will be high for large prime p. In this paper, we present a multiparty comparison protocol with constant rounds in which the number of multiplications depends on the number of players rather than the prime p itself. This multiparty comparison protocol is further extended to design a multiparty equality-test protocol. An equality-test protocol computes the equality of shares in constant rounds and its number of multiplications depends on the number of players. Our proposed protocols multiparty comparison and equality-test are unconditionally secure against the active and passive attacks and have O(n) communication complexity, where n is the number of players. We also present an efficient technique for fault detection that can verify the correctness of various protocols.
Keywords:
Millionaires' problem
secure computation
data privacy
information security
multiparty computation
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K