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

Lecture notes in computer science

Secure Arithmetic Computation with No Honest Majority

Yuval Ishai, Manoj Prabhakaran, Amit Sahai

Published Jan 1, 2009• 145 citations
Publisher
DOI
10.1007/978-3-642-00457-5_18

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

Improved Building Blocks for Secure Multi-party Computation Based on Secret Sharing with Honest Majority

Marina Blanton, Ah Reum Kang, Chen Yuan

Lecture notes in computer science•Jan 1, 2020•24 citations

On Multiparty Garbling of Arithmetic Circuits.

Aner Ben-Efraim

We initiate a study of garbled circuits that contain both Boolean and arithmetic gates in secure multiparty computation. In particular, we incorporate the garbling gadgets for arithmetic circuits recently presented by Ball, Malkin, and Rosulek (ACM CCS 2016) into the multiparty garbling paradigm initially introduced by Beaver, Micali, and Rogaway (STOC ’90). This is the first work that studies arithmetic garbled circuits in the multiparty setting. Using mixed Boolean-arithmetic circuits allows more efficient secure computation of functions that naturally combine Boolean and arithmetic computations. Our garbled circuits are secure in the semi-honest model, under the same hardness assumptions as Ball et al., and can be efficiently and securely computed in constant rounds assuming an honest majority.

•Jan 1, 2017•1 citation

Secure Arithmetic Computation with Constant Computational Overhead

Benny Applebaum, Ivan Damgård, Yuval Ishai +2 more

Lecture notes in computer science•Jan 1, 2017•101 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
We initiate a study of garbled circuits that contain both Boolean and arithmetic gates in secure multiparty computation. In particular, we incorporate the garbling gadgets for arithmetic circuits recently presented by Ball, Malkin, and Rosulek (ACM CCS 2016) into the multiparty garbling paradigm initially introduced by Beaver, Micali, and Rogaway (STOC ’90). This is the first work that studies arithmetic garbled circuits in the multiparty setting. Using mixed Boolean-arithmetic circuits allows more efficient secure computation of functions that naturally combine Boolean and arithmetic computations. Our garbled circuits are secure in the semi-honest model, under the same hardness assumptions as Ball et al., and can be efficiently and securely computed in constant rounds assuming an honest majority.
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.