Lecture notes in computer science

On the Round Complexity of Dishonest-Majority MPC

Ran Cohen, Daniel E. Collins, Pouyan Forghani, Juan A. Garay, Vassilis Zikas

Published Oct 30, 2026• 0 citations

Publisher

DOI: 10.1007/978-3-032-43617-7_2

Related papers

On the Round Complexity of Fully Secure Solitary MPC with Honest Majority

Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee +1 more

Lecture notes in computer scienceJan 1, 20233 citations

Dishonest Majority Constant-Round MPC with Linear Communication from DDH

Vipul Goyal, Junru Li, Ankit Kumar Misra +3 more

Lecture notes in computer scienceDec 11, 202412 citations

Efficient, Actively Secure MPC with a Dishonest Majority: A Survey

Emmanuela Orsini

Lecture notes in computer scienceJan 1, 202113 citations

Actively Secure MPC in the Dishonest Majority Setting: Achieving Constant Complexity in Online Communication, Computation Per Gate, Rounds, and Private Input Size

Seung Hwan Lee, Jaesang Noh, Taejeong Kim +2 more

Lecture notes in computer scienceJan 1, 20250 citations

Round Efficiency of Multi-party Computation with a Dishonest Majority

Jonathan I. Katz, Rafail Ostrovsky, Adam Smith

Lecture notes in computer scienceJan 1, 200395 citations

On Fully-Secure Honest Majority MPC Without $$n^2$$ Round Overhead

Daniel E. Escudero, Serge Fehr

Lecture notes in computer scienceJan 1, 20232 citations