Secure Comparison Without Explicit XOR
This work provides an incremental improvement for secure auctions by enhancing efficiency in secure multi-party computation.
The paper tackles the problem of secure integer comparison between two parties, presenting a protocol that reduces computational complexity by roughly half compared to the best known efficient protocol by eliminating time-consuming XOR operations.
We propose an efficient protocol for secure comparison of integers when both integers are shared between two parties. Such protocols are useful for implementing secure auctions. The proposed protocol's computational complexity is roughly half the complexity of the best known efficient protocol. The efficiency of the proposed protocol stems from the removal of the XOR computation which is a time consuming operation.