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

An Efficient Secure Three-Party Sorting Protocol with an Honest Majority.

Koji Chida, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Naoto Kiribuchi, Benny Pinkas B

Published Jan 1, 2019• 16 citations
OpenAlex

Related papers

High-Throughput Secure Three-Party Computation with an Honest Majority

Jun Furukawa, Yehuda Lindell, Ariel Nof +1 more

Journal of Cryptology•May 22, 2023•4 citations

High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority

Jun Furukawa, Yehuda Lindell, Ariel Nof +1 more

Lecture notes in computer science•Jan 1, 2017•155 citations

Secure Multiparty Sorting Protocols with Covert Privacy

Peeter Laud, Martin Pettai

Lecture notes in computer science•Jan 1, 2016•11 citations

ECHO: Efficient Covertly-Secure Three-party Computation with Applications to Private Machine Learning

Yufei Duan, Yun Li, Zhicong Huang +3 more

Secure three-party computation with an honest majority is among the most efficient secure computation settings and is widely used in practice. However, achieving malicious security incurs significant overhead, often an order of magnitude higher than semi-honest protocols. Covert security provides a security–efficiency trade-off by detecting malicious behavior with a certain probability (e.g., 50%), deterring rational adversaries. Existing covert protocols mainly target two-party or dishonest-majority settings, with little work on efficient honest-majority three-party solutions. We present ECHO, a family of concretely efficient protocols for covertly secure honest-majority three-party computation. We explore the design space of cheating detection and identification, and develop optimized protocols for both arithmetic and Boolean circuits, targeting different performance goals such as low latency and reduced communication. For arithmetic circuits over rings, our asymmetric-MAC-based protocol achieves an online phase only 1.26× slower than the semi-honest baseline and over 5.59× faster than MAC-based maliciously secure protocol. For Boolean circuits, our method improves over the best malicious protocol by 5×. We also applied ECHO on practical PPML tasks. ECHO approaches semi-honest performance while providing up to 8× speedup over malicious security.

IEEE Transactions on Information Forensics and Security•Jan 1, 2026•0 citations

An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings.

Mark Abspoel, Anders Dalskov, Daniel E. Escudero +1 more

Multiparty computation (MPC) over rings such as \(\mathbb {Z}_{2^{32}}\) or \(\mathbb {Z}_{2^{64}}\) has received a great deal of attention recently due to its ease of implementation and attractive performance. Several actively secure protocols over these rings have been implemented, for both the dishonest majority setting and the setting of three parties with one corruption. However, in the honest majority setting, no concretely efficient protocol for arithmetic computation over rings has yet been proposed that allows for an arbitrary number of parties.

•Jan 1, 2019•3 citations

The oblivious comparison sorting protocols for secure multi-party computation

Koteswararao Ch, Kunwar Singh, Anoop Kumar

Multimedia Tools and Applications•Jan 27, 2024•0 citations
Secure three-party computation with an honest majority is among the most efficient secure computation settings and is widely used in practice. However, achieving malicious security incurs significant overhead, often an order of magnitude higher than semi-honest protocols. Covert security provides a security–efficiency trade-off by detecting malicious behavior with a certain probability (e.g., 50%), deterring rational adversaries. Existing covert protocols mainly target two-party or dishonest-majority settings, with little work on efficient honest-majority three-party solutions. We present ECHO, a family of concretely efficient protocols for covertly secure honest-majority three-party computation. We explore the design space of cheating detection and identification, and develop optimized protocols for both arithmetic and Boolean circuits, targeting different performance goals such as low latency and reduced communication. For arithmetic circuits over rings, our asymmetric-MAC-based protocol achieves an online phase only 1.26× slower than the semi-honest baseline and over 5.59× faster than MAC-based maliciously secure protocol. For Boolean circuits, our method improves over the best malicious protocol by 5×. We also applied ECHO on practical PPML tasks. ECHO approaches semi-honest performance while providing up to 8× speedup over malicious security.
Multiparty computation (MPC) over rings such as Z232\mathbb {Z}_{2^{32}}Z232​ or Z264\mathbb {Z}_{2^{64}}Z264​ has received a great deal of attention recently due to its ease of implementation and attractive performance. Several actively secure protocols over these rings have been implemented, for both the dishonest majority setting and the setting of three parties with one corruption. However, in the honest majority setting, no concretely efficient protocol for arithmetic computation over rings has yet been proposed that allows for an arbitrary number of parties.