Lecture notes in computer science

Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries

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

Published Jan 1, 2021• 4 citations

Related papers

Amortized Complexity of Information-Theoretically Secure MPC Revisited

Ignacio Cascudo, Ronald Cramer, Chaoping Xing +1 more

Two Round Information-Theoretic MPC with Malicious Security

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

Perfectly-Secure Asynchronous MPC for General Adversaries (Extended Abstract)

Ashish Choudhury, Nikhil Pappu

Perfectly-Secure MPC Tolerating General Adversaries

Ashish Choudhury, Arpita Patra

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

Huijia Lin, Tianren Liu, Hoeteck Wee

Multiplicative Depth Independent & Efficient MPC in the Presence of Mixed Adversary.

Achintya Desai, S. Sundar Raj, Kannan Srinathan