Lecture notes in computer science

On the Correlation Complexity of MPC with Cheater Identification

Nicholas Brandt, Sven Maier, Tobias Müller, Jörn Müller‐Quade

Published Nov 30, 2023• 0 citations

Related papers

Catching MPC Cheaters: Identification and Openability

Robert K. Cunningham, Benjamin W. Fuller, Sophia Yakoubov

On the Bottleneck Complexity of MPC with Correlated Randomness

Claudio Orlandi, Divya Ravi, Peter Schöll

Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs

Carsten Baum, Nikolas Melissaris, Rahul Rachuri +1 more

On the Round Complexity of Dishonest-Majority MPC

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

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

Amortized Complexity of Information-Theoretically Secure MPC Revisited

Ignacio Cascudo, Ronald Cramer, Chaoping Xing +1 more