Secure comparison protocols in the semi-honest model
article
Due to high complexity, comparison protocols with secret inputs have been a bottleneck in the design of privacy-preserving 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 analyze the stateof- the-art comparison protocols for a two-party setting in the semihonest security protocol. We analyze their performances in three stages, namely initialization, pre-processing 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. © 2015 IEEE.
Topics
TNO Identifier
528365
Source
IEEE Journal on Selected Topics in Signal Processing, 9(7), pp. 1217-1228.
Publisher
Institute of Electrical and Electronics Engineers Inc.
Pages
1217-1228
Files
To receive the publication files, please send an e-mail request to TNO Repository.