Secure Comparison Protocols in the Semi-Honest Model

Due to high complexity, comparison protocols with secret inputs have been a bottleneck in the design of privacypreserving cryptographic protocols. Different solutions based on homomorphic encryption, garbled circuits and secret sharing techniques have been proposed over the last few years, each claiming high efficiency. Unfortunately, a fair comparison of existing protocols in terms of run-time, bandwidth requirement and round complexity has been lacking so far. In this paper, we analyse the state-of-the-art comparison protocols for a twoparty setting in the semi-honest security protocol. We analyse their performances in three stages, namely initialization, preprocessing and online computation, by implementing them on a single platform. The results of our experiments provide a clear insight for the research community into the advantages and disadvantages of the various techniques.