© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Lecture notes in computer science

Dishonest Majority Multi-Party Computation for Binary Circuits

Enrique Larraia, Emmanuela Orsini, Nigel Paul Smart

Published Jan 1, 2014• 65 citations

DOI: 10.1007/978-3-662-44381-1_28

Related papers

Adaptively Secure Multi-Party Computation with Dishonest Majority

Sanjam Garg, Amit Sahai

Lecture notes in computer science•Jan 1, 2012•32 citations

Round Efficiency of Multi-party Computation with a Dishonest Majority

Jonathan I. Katz, Rafail Ostrovsky, Adam Smith

Lecture notes in computer science•Jan 1, 2003•95 citations

Secure Multi-party Quantum Computation with a Dishonest Majority

Yfke Dulek, Alex B. Grilo, Stacey Jeffery +2 more

arXiv:1909.13770•Lecture notes in computer science•Jan 1, 2020•50 citations

Complete Fairness in Multi-party Computation without an Honest Majority

Steven Gordon, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2009•54 citations

Complete Fairness in Multi-Party Computation Without an Honest Majority.

Steven Gordon, Jonathan I. Katz

•Jan 1, 2008•0 citations

Dishonest Majority Multi-Party Computation for Binary Circuits.

Enrique Larraia, Emmanuela Orsini, Nigel Paul Smart

Abstract. We extend the Tiny-OT two party protocol of Nielsen et al (CRYPTO 2012) to the case of n parties in the dishonest majority setting. This is done by presenting a novel way of transferring pairwise authentications into global authentications. As a by product we obtain a more efficient manner of producing globally authenticated shares, in the random oracle model, which in turn leads to a more efficient two party protocol than that of Nielsen et al. 1

•Jan 1, 2014•0 citations