Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Efficient Secure Comparison Protocols.

Geoffroy Couteau

Published Jan 1, 2016• 11 citations
OpenAlex

Related papers

A Generalization of Secure Comparison Protocol with Encrypted Output and Its Efficiency Estimation

Takumi Kobayashi, Keisuke Hakuta

Lecture notes in networks and systems•Sep 16, 2021•0 citations

Secure Comparison Without Explicit XOR

R. Katti, Cristinel Ababei

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.

arXiv:1204.2854•Apr 12, 2012•4 citations

An Efficient Privacy-Preserving Comparison Protocol

Tushar Kanti Saha, Takeshi Koshiba

Lecture notes on data engineering and communications technologies•Aug 22, 2017•8 citations

An Efficient Protocol for Private Comparison Problem

Luo -, Yonglong, Huang +5 more

Chinese Journal of Electronics•Jan 1, 2009•7 citations

Efficient secure comparison in the dishonest majority model

Ali Ataeemh Allami

Secure comparison (SC) is an essential primitive in Secure Multiparty Computation (SMC) and a fundamental building block in Privacy-Preserving Data Analytics (PPDA). Although secure comparison has been studied since the introduction of SMC in the early 80s and many protocols have been proposed, there is still room for improvement, especially providing security against malicious adversaries who form the majority among the participating parties. It is not hard to develop an SC protocol secure against malicious majority based on the current state-of-the-art SPDZ framework. SPDZ is designed to work for arbitrary polynomially-bounded functionalities; it may not provide the most efficient SMC implementation for a specific task, such as SC. In this thesis, we propose a novel and efficient compiler specifically designed to convert most existing SC protocols with semi-honest security into the ones secure against the dishonest majority (malicious majority). We analyze the security of the proposed solutions using the real-ideal paradigm. Moreover, we provide computation and communication complexity analysis. Comparing to the current state-of-the-art SC protocols Rabbit and edaBits, our design offers significant performance gain. The empirical results show that the proposed solution is at least 5 and 10 times more efficient than Rabbit in run-time and communication cost respectively.

•Dec 1, 2021•0 citations

Secure Multi-party Comparison Protocol and Application

Jing Zhang, Shoushan Luo, Yixian Yang

Communications in computer and information science•Jan 1, 2017•1 citation
Secure comparison (SC) is an essential primitive in Secure Multiparty Computation (SMC) and a fundamental building block in Privacy-Preserving Data Analytics (PPDA). Although secure comparison has been studied since the introduction of SMC in the early 80s and many protocols have been proposed, there is still room for improvement, especially providing security against malicious adversaries who form the majority among the participating parties. It is not hard to develop an SC protocol secure against malicious majority based on the current state-of-the-art SPDZ framework. SPDZ is designed to work for arbitrary polynomially-bounded functionalities; it may not provide the most efficient SMC implementation for a specific task, such as SC. In this thesis, we propose a novel and efficient compiler specifically designed to convert most existing SC protocols with semi-honest security into the ones secure against the dishonest majority (malicious majority). We analyze the security of the proposed solutions using the real-ideal paradigm. Moreover, we provide computation and communication complexity analysis. Comparing to the current state-of-the-art SC protocols Rabbit and edaBits, our design offers significant performance gain. The empirical results show that the proposed solution is at least 5 and 10 times more efficient than Rabbit in run-time and communication cost respectively.