Two Round Information-Theoretic MPC with Malicious Security
暂无分享,去创建一个
Arka Rai Choudhuri | Abhishek Jain | Aarushi Goel | Prabhanjan Vijendra Ananth | Abhishek Jain | P. Ananth | Aarushi Goel | A. Choudhuri
[1] Avi Wigderson,et al. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.
[2] Yuval Ishai,et al. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator , 2005, CRYPTO.
[3] Sanjam Garg,et al. Two-round Multiparty Secure Computation from Minimal Assumptions , 2018, IACR Cryptol. ePrint Arch..
[4] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[5] Anat Paskin-Cherniavsky,et al. Secure Computation with Minimal Interaction, Revisited , 2015, CRYPTO.
[6] Arka Rai Choudhuri,et al. Round-Optimal Secure Multiparty Computation with Honest Majority , 2018, IACR Cryptol. ePrint Arch..
[7] Donald Beaver,et al. Multiparty Protocols Tolerating Half Faulty Processors , 1989, CRYPTO.
[8] David Chaum,et al. The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities , 1989, CRYPTO.
[9] Yehuda Lindell,et al. On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions , 2003, EUROCRYPT.
[10] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[11] Arpita Patra,et al. On the Exact Round Complexity of Secure Three-Party Computation , 2018, Journal of Cryptology.
[12] Silvio Micali,et al. A Completeness Theorem for Protocols with Honest Majority , 1987, STOC 1987.
[13] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[14] Judit Bar-Ilan,et al. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction , 1989, PODC '89.
[15] Yehuda Lindell,et al. Secure Multi-Party Computation without Agreement , 2005, Journal of Cryptology.
[16] Yuval Ishai,et al. Two-Round MPC: Information-Theoretic and Black-Box , 2018, IACR Cryptol. ePrint Arch..
[17] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[18] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[19] Yehuda Lindell,et al. Secure Computation on the Web: Computing without Simultaneous Interaction , 2011, IACR Cryptol. ePrint Arch..
[20] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[21] Yuval Ishai,et al. On the Hardness of Information-Theoretic Multiparty Computation , 2004, EUROCRYPT.
[22] Ivan Damgård,et al. Secure Distributed Linear Algebra in a Constant Number of Rounds , 2001, CRYPTO.
[23] Yuval Ishai,et al. On 2-Round Secure Multiparty Computation , 2002, CRYPTO.
[24] 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.
[25] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[26] Sanjam Garg,et al. Two-Round Multiparty Secure Computation Minimizing Public Key Operations , 2018, IACR Cryptol. ePrint Arch..
[27] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[28] Yael Tauman Kalai,et al. Promise Zero Knowledge and its Applications to Round Optimal MPC , 2018, IACR Cryptol. ePrint Arch..
[29] Zvika Brakerski,et al. Degree 2 is Complete for the Round-Complexity of Malicious MPC , 2019, IACR Cryptol. ePrint Arch..
[30] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[31] Yuval Ishai,et al. Private simultaneous messages protocols with applications , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[32] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[33] Sanjam Garg,et al. Garbled Protocols and Two-Round MPC from Bilinear Maps , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[34] Yuval Ishai,et al. Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials , 2002, ICALP.
[35] Anat Paskin-Cherniavsky,et al. Secure Multiparty Computation with Minimal Interaction , 2010, CRYPTO.
[36] Silvio Micali,et al. The Round Complexity of Secure Protocols (Extended Abstract) , 1990, STOC 1990.
[37] Zvika Brakerski,et al. Perfect Secure Computation in Two Rounds , 2018, IACR Cryptol. ePrint Arch..
[38] Yuval Ishai,et al. The round complexity of verifiable secret sharing and secure multicast , 2001, STOC '01.
[39] Fabrice Benhamouda,et al. k-Round MPC from k-Round OT via Garbled Interactive Circuits , 2017, IACR Cryptol. ePrint Arch..