Lecture notes in computer science

Amortized Complexity of Information-Theoretically Secure MPC Revisited

Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan

Published Jan 1, 2018• 65 citations

Related papers

A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity

Ignacio Cascudo, Jaron Skovsted Gundersen

Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries

Ivan Damgård, Daniel E. Escudero, Divya Ravi

Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More

Huijia Lin, Tianren Liu, Hoeteck Wee

Two Round Information-Theoretic MPC with Malicious Security

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

Adaptively Secure MPC with Sublinear Communication Complexity

Ran Cohen, Abhi A. Shelat, Daniel Wichs

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more