Lecture notes in computer science

Weakly Super-Invertible Matrices and Constant Communication Dishonest Majority MPC

Alexander Bienstock, Kevin Yeo

Published Jan 1, 2025• 1 citation

Related papers

On the Round Complexity of Dishonest-Majority MPC

Ran Cohen, Daniel E. Collins, Pouyan Forghani +2 more

Dishonest Majority Constant-Round MPC with Linear Communication from DDH

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

Communication-Efficient Proactive MPC for Dynamic Groups with Dishonest Majorities

Karim Eldefrawy, Tancrède Lepoint, Antonin Leroux

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

Emmanuela Orsini

Ramp Hyper-invertible Matrices and Their Applications to MPC Protocols

Hongqing Liu, Chaoping Xing, Yanjiang Yang +1 more

Honest Majority Constant-Round MPC with Linear Communication from One-Way Functions

Junru Li, Yifan Song