Lecture notes in computer science

Degree 2 is Complete for the Round-Complexity of Malicious MPC

Benny Applebaum, Zvika Brakerski, Rotem Tsabary

Published Jan 1, 2019• 21 citations

Related papers

Two-Round MPC Without Round Collapsing Revisited – Towards Efficient Malicious Protocols

Huijia Lin, Tianren Liu

Two Round Information-Theoretic MPC with Malicious Security

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel +1 more

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

On the Round Complexity of Dishonest-Majority MPC

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

The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency

Benny Applebaum, Eliran Kachlon, Arpita Patra

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

Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee +1 more