A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation

At STOC ’87, Goldreich et al. presented two protocols for secure multi-party computation (MPC) among n parties: The first protocol provides passive security against t < n corrupted parties. The second protocol provides even active security, but only against t < n/2 corrupted parties. Although these protocols provide security against the provably highest possible number of corruptions, each of them has its limitation: The first protocol is rendered completely insecure in presence of a single active corruption, and the second protocol is rendered completely insecure in presence of ⌈n/2 ⌉ passive corruptions.

[1]  Moti Yung,et al.  Perfectly secure message transmission , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[2]  Torben P. Pedersen.  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

[3]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[4]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[5]  Jonathan Katz.  On achieving the "best of both worlds" in secure multiparty computation , 2007, STOC '07.

[6]  Manuel Blum.  How to exchange (secret) keys , 1983, STOC '83.

[7]  Donald Beaver,et al.  Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority , 2004, Journal of Cryptology.

[8]  Ueli Maurer,et al.  Hybrid-secure MPC: trading information-theoretic robustness for computational privacy , 2010, IACR Cryptol. ePrint Arch..

[9]  Andrew Chi-Chih Yao,et al.  Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.

[10]  Ueli Maurer,et al.  MPC vs. SFE : Unconditional and Computational Security , 2008, ASIACRYPT.

[11]  Danny Dolev,et al.  Polynomial algorithms for multiple processor agreement , 1982, STOC '82.

[12]  Ueli Maurer,et al.  Graceful Degradation in Multi-Party Computation (Extended Abstract) , 2011, ICITS.

[13]  Ueli Maurer,et al.  Passive Corruption in Statistical Multi-Party Computation , 2012, IACR Cryptology ePrint Archive.

[14]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[15]  Oded Goldreich,et al.  Foundations of Cryptography: Volume 2, Basic Applications , 2004 .

[16]  Manuel Blum.  How to Exchange (Secret) Keys (Extended Abstract) , 1983, STOC 1983.

[17]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[18]  Matthias Fitzi,et al.  Multi-party Computation with Hybrid Security , 2004, EUROCRYPT.

[19]  Matthias Fitzi,et al.  Two-Threshold Broadcast and Detectable Multi-party Computation , 2003, EUROCRYPT.

[20]  Ueli Maurer,et al.  Graceful Degradation in Multi-Party Computation , 2011, IACR Cryptol. ePrint Arch..

[21]  Yehuda Lindell,et al.  On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation , 2006, CRYPTO.

[22]  David Chaum,et al.  The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities , 1989, CRYPTO.

[23]  Matthias Fitzi,et al.  Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract) , 1998, CRYPTO.

[24]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.