Lecture notes in computer science

New Upper and Lower Bounds for Perfectly Secure MPC

Ivan Damgård, Shravani Patil, Arpita Patra, Lawrence Roy

Published Jan 1, 2026• 0 citations

Related papers

Communication Lower Bounds for Perfect Maliciously Secure MPC.

Ivan Damgård, Nikolaj I. Schwartzbach

Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing

Ivan Damgård, Kasper Green Larsen, Jesper Buus Nielsen

Perfectly-Secure MPC Tolerating General Adversaries

Ashish Choudhury, Arpita Patra

Perfectly-Secure MPC with Linear Communication Complexity

Zuzana Beerliová-Trubíniová, Martin Hirt

Perfectly-Secure MPC for Small Number of Parties

Ashish Choudhury, Arpita Patra

Perfectly-Secure MPC in the Pre-processing Model

Ashish Choudhury, Arpita Patra