Hybrid-secure MPC: trading information-theoretic robustness for computational privacy

Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted parties is below a certain threshold, these protocols provide all specified security guarantees. Beyond this threshold, they provide no security guarantees at all. Furthermore, most previous protocols achieve either information-theoretic (IT) security, in which case this threshold is low, or they achieve only computational security, in which case this threshold is high. In contrast, a hybrid-secure protocol provides different security guarantees depending on the set of corrupted parties and the computational power of the adversary, without being aware of the actual adversarial setting. Thus, hybrid-secure MPC protocols allow for graceful degradation of security. We present a hybrid-secure MPC protocol that provides an optimal trade-off between IT robustness and computational privacy: For any robustness para...

• Type: Conference
• Year: 2010
• Where: PODC
• Authors: Christoph Lucas, Dominik Raub, Ueli M. Maurer
• Keywords: Corrupted Parties, Distributed And Parallel Computing, Mpc Protocol, PODC 2010, Security Guarantees