On the Message Complexity of Secure Multiparty Computation
暂无分享,去创建一个
[1] Kai-Min Chung,et al. Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs , 2015, CRYPTO.
[2] Rafail Ostrovsky,et al. The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults , 2015, ITCS.
[3] Rafail Ostrovsky,et al. Unconditionally Secure Computation with Reduced Interaction , 2016, EUROCRYPT.
[4] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[5] Anat Paskin-Cherniavsky,et al. On the Power of Correlated Randomness in Secure Computation , 2013, TCC.
[6] Silvio Micali,et al. How to play any mental game, or a completeness theorem for protocols with honest majority , 2019, Providing Sound Foundations for Cryptography.
[7] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[8] Avi Wigderson,et al. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.
[9] Sanjam Garg,et al. Two-round Multiparty Secure Computation from Minimal Assumptions , 2018, IACR Cryptol. ePrint Arch..
[10] Shafi Goldwasser,et al. Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting , 2013, TCC.
[11] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[12] Fabrice Benhamouda,et al. k-Round MPC from k-Round OT via Garbled Interactive Circuits , 2017, IACR Cryptol. ePrint Arch..
[13] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[14] Rafail Ostrovsky,et al. Cryptography with constant computational overhead , 2008, STOC.
[15] Ivan Damgård,et al. On the Communication Required for Unconditionally Secure Multiplication , 2016, CRYPTO.
[16] Eyal Kushilevitz,et al. A Communication-Privacy Tradeoff for Modular Addition , 1993, Inf. Process. Lett..
[17] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[18] Yuval Ishai,et al. Foundations of Homomorphic Secret Sharing , 2018, ITCS.
[19] Mihir Bellare,et al. Foundations of garbled circuits , 2012, CCS.
[20] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[21] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[22] Moti Yung,et al. Secure Multi-party Computation Minimizing Online Rounds , 2009, ASIACRYPT.
[23] Yuval Ishai,et al. Secure Multiparty Computation with General Interaction Patterns , 2016, IACR Cryptol. ePrint Arch..
[24] Ivan Damgård,et al. Multiparty Computation from Threshold Homomorphic Encryption , 2000, EUROCRYPT.
[25] Rafail Ostrovsky,et al. The Price of Low Communication in Secure Multi-party Computation , 2017, CRYPTO.
[26] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[27] Daniel Wichs,et al. Two Round Multiparty Computation via Multi-key FHE , 2016, EUROCRYPT.