Promise Zero Knowledge and its Applications to Round Optimal MPC
暂无分享,去创建一个
Yael Tauman Kalai | Amit Sahai | Vipul Goyal | Abhishek Jain | Dakshita Khurana | Saikrishna Badrinarayanan | A. Sahai | Abhishek Jain | Vipul Goyal | Y. Kalai | S. Badrinarayanan | Dakshita Khurana
[1] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[2] Moni Naor,et al. Non-Malleable Cryptography (Extended Abstract) , 1991, STOC 1991.
[3] Arka Rai Choudhuri,et al. A New Approach to Round-Optimal Secure Multiparty Computation , 2017, CRYPTO.
[4] Vipul Goyal,et al. Constant round non-malleable protocols using one way functions , 2011, STOC '11.
[5] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[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] Craig Gentry,et al. Two-Round Secure MPC from Indistinguishability Obfuscation , 2014, TCC.
[8] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.
[9] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[10] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[11] Yael Tauman Kalai,et al. Distinguisher-Dependent Simulation in Two Rounds and its Applications , 2017, CRYPTO.
[12] Yehuda Lindell,et al. Efficient Secure Two-Party Protocols: Techniques and Constructions , 2010 .
[13] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[14] Vinod Vaikuntanathan,et al. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE , 2012, EUROCRYPT.
[15] Alon Rosen,et al. A Note on Constant-Round Zero-Knowledge Proofs for NP , 2004, TCC.
[16] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[17] Amit Sahai,et al. Round Optimal Concurrent MPC via Strong Simulation , 2017, TCC.
[18] Daniel Wichs,et al. Two Round Multiparty Computation via Multi-key FHE , 2016, EUROCRYPT.
[19] Rafael Pass,et al. Bounded-concurrent secure multi-party computation with a dishonest majority , 2004, STOC '04.
[20] Rafail Ostrovsky,et al. Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds , 2017, IACR Cryptol. ePrint Arch..
[21] Rafail Ostrovsky,et al. Round-Optimal Secure Two-Party Computation from Trapdoor Permutations , 2017, IACR Cryptol. ePrint Arch..
[22] Rafael Pass,et al. Concurrent Non-malleable Commitments from Any One-Way Function , 2008, TCC.
[23] Rafail Ostrovsky,et al. Zero-knowledge from secure multiparty computation , 2007, STOC '07.
[24] Rafail Ostrovsky,et al. Concurrent Non-Malleable Commitments (and More) in 3 Rounds , 2016, CRYPTO.
[25] Sanjam Garg,et al. Two-round Multiparty Secure Computation from Minimal Assumptions , 2018, IACR Cryptol. ePrint Arch..
[26] Silas Richelson,et al. Textbook non-malleable commitments , 2016, STOC.
[27] Shai Halevi,et al. Four Round Secure Computation Without Setup , 2017, TCC.
[28] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[29] Rafail Ostrovsky,et al. Round-Optimal Secure Two-Party Computation , 2004, CRYPTO.
[30] Sanjam Garg,et al. The Exact Round Complexity of Secure Computation , 2016, EUROCRYPT.
[31] Amit Sahai,et al. Concurrently Secure Computation in Constant Rounds , 2012, EUROCRYPT.
[32] Yuval Ishai,et al. Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions , 2017, ASIACRYPT.
[33] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[34] Carmit Hazay,et al. Round-Optimal Secure Multi-party Computation , 2018, Journal of Cryptology.
[35] Yael Tauman Kalai,et al. Smooth Projective Hashing and Two-Message Oblivious Transfer , 2005, Journal of Cryptology.
[36] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.
[37] Dakshita Khurana,et al. Round Optimal Concurrent Non-malleability from Polynomial Hardness , 2017, TCC.
[38] Yael Tauman Kalai,et al. Multi-collision resistance: a paradigm for keyless hash functions , 2018, IACR Cryptol. ePrint Arch..
[39] Fabrice Benhamouda,et al. k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits , 2018, EUROCRYPT.
[40] Fabrice Benhamouda,et al. k-Round MPC from k-Round OT via Garbled Interactive Circuits , 2017, IACR Cryptol. ePrint Arch..
[41] Silas Richelson,et al. An Algebraic Approach to Non-malleability , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[42] Amit Sahai,et al. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[43] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[44] Silvio Micali,et al. The Round Complexity of Secure Protocols (Extended Abstract) , 1990, STOC 1990.
[45] Adi Shamir,et al. Multiple non-interactive zero knowledge proofs based on a single random string , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[46] Sanjam Garg,et al. On the Exact Round Complexity of Self-composable Two-Party Computation , 2017, EUROCRYPT.
[47] Hoeteck Wee,et al. Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions , 2010, EUROCRYPT.
[48] Amit Sahai,et al. How to play almost any mental game over the net - concurrent composition via super-polynomial simulation , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[49] Moni Naor,et al. Zaps and their applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[50] 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).
[51] Rafail Ostrovsky,et al. Round Efficiency of Multi-party Computation with a Dishonest Majority , 2003, EUROCRYPT.
[52] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[53] Amit Sahai,et al. Concurrent zero knowledge with logarithmic round-complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[54] Vinod Vaikuntanathan,et al. Adaptive One-Way Functions and Applications , 2008, CRYPTO.
[55] Rafail Ostrovsky,et al. Password-Authenticated Session-Key Generation on the Internet in the Plain Model , 2010, CRYPTO.
[56] Adi Shamir,et al. Publicly Verifiable Non-Interactive Zero-Knowledge Proofs , 1990, CRYPTO.
[57] Rafael Pass,et al. Concurrent non-malleable commitments , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[58] Hoeteck Wee,et al. Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[59] Yehuda Lindell,et al. How To Simulate It - A Tutorial on the Simulation Proof Technique , 2016, IACR Cryptol. ePrint Arch..
[60] Amit Sahai,et al. Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions , 2017, IACR Cryptol. ePrint Arch..