On Communication Models and Best-Achievable Security in Two-Round MPC
暂无分享,去创建一个
Manoj Prabhakaran | Abhishek Jain | Aarushi Goel | Rajeev Raghunath | Abhishek Jain | M. Prabhakaran | Aarushi Goel | Rajeev Raghunath
[1] Anat Paskin-Cherniavsky,et al. Secure Multiparty Computation with Minimal Interaction , 2010, CRYPTO.
[2] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[3] Fabrice Benhamouda,et al. k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits , 2018, EUROCRYPT.
[4] Rafail Ostrovsky,et al. Cryptography in the Multi-string Model , 2007, CRYPTO.
[5] Nancy A. Lynch,et al. Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.
[6] Luisa Siniscalchi,et al. Broadcast-Optimal Two Round MPC with an Honest Majority , 2020, IACR Cryptol. ePrint Arch..
[7] Adi Shamir,et al. How to share a secret , 1979, CACM.
[8] Sanjam Garg,et al. Two-round Multiparty Secure Computation from Minimal Assumptions , 2018, IACR Cryptol. ePrint Arch..
[9] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[10] Anat Paskin-Cherniavsky,et al. Secure Computation with Minimal Interaction, Revisited , 2015, CRYPTO.
[11] Amit Sahai,et al. Secure MPC: Laziness Leads to GOD , 2018, IACR Cryptol. ePrint Arch..
[12] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[13] Arka Rai Choudhuri,et al. Two Round Information-Theoretic MPC with Malicious Security , 2019, IACR Cryptol. ePrint Arch..
[14] Arka Rai Choudhuri,et al. Round-Optimal Secure Multiparty Computation with Honest Majority , 2018, IACR Cryptol. ePrint Arch..
[15] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[16] Rafail Ostrovsky,et al. Secure Multi-Party Computation with Identifiable Abort , 2014, CRYPTO.
[17] Amit Sahai,et al. On the (im)possibility of obfuscating programs , 2001, JACM.
[18] Yuval Ishai,et al. Randomizing polynomials: A new representation with applications to round-efficient secure computation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[19] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[20] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[21] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Abstract) , 1987, CRYPTO.
[22] Zvika Brakerski,et al. Degree 2 is Complete for the Round-Complexity of Malicious MPC , 2019, IACR Cryptol. ePrint Arch..
[23] Oded Goldreich,et al. Definitions and properties of zero-knowledge proof systems , 1994, Journal of Cryptology.
[24] Moni Naor,et al. Zaps and their applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[25] Juan A. Garay,et al. Broadcast-Optimal Two-Round MPC , 2020, IACR Cryptol. ePrint Arch..
[26] Avi Wigderson,et al. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.
[27] Silvio Micali,et al. A Completeness Theorem for Protocols with Honest Majority , 1987, STOC 1987.
[28] Yuval Ishai,et al. Two-Round MPC: Information-Theoretic and Black-Box , 2018, IACR Cryptol. ePrint Arch..
[29] Arpita Patra,et al. On the Exact Round Complexity of Secure Three-Party Computation , 2018, Journal of Cryptology.
[30] Yehuda Lindell,et al. Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation , 2014, ASIACRYPT.
[31] Vinod Vaikuntanathan,et al. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE , 2012, EUROCRYPT.
[32] Elaine Shi,et al. Constant-Round MPC with Fairness and Guarantee of Output Delivery , 2015, CRYPTO.
[33] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[34] Zvika Brakerski,et al. Perfect Secure Computation in Two Rounds , 2018, IACR Cryptol. ePrint Arch..
[35] Yuval Ishai,et al. On 2-Round Secure Multiparty Computation , 2002, CRYPTO.
[36] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.