Round Optimal Black-Box “Commit-and-Prove”
暂无分享,去创建一个
Rafail Ostrovsky | Dakshita Khurana | Akshayaram Srinivasan | R. Ostrovsky | Akshayaram Srinivasan | Dakshita Khurana
[1] Yehuda Lindell,et al. Black-box constructions for secure computation , 2006, STOC '06.
[2] Carmit Hazay,et al. On the Power of Secure Two-Party Computation , 2019, Journal of Cryptology.
[3] Claudio Orlandi,et al. LEGO for Two-Party Secure Computation , 2009, TCC.
[4] Rafail Ostrovsky,et al. Round-Optimal Secure Two-Party Computation , 2004, CRYPTO.
[5] Adi Shamir,et al. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions , 1999, SIAM J. Comput..
[6] David P. Woodruff. Revisiting the Efficiency of Malicious Two-Party Computation , 2007, EUROCRYPT.
[7] Alex J. Malozemoff,et al. Amortizing Garbled Circuits , 2015, IACR Cryptol. ePrint Arch..
[8] Arash Afshar,et al. How to Efficiently Evaluate RAM Programs with Malicious Security , 2014, EUROCRYPT.
[9] Alon Rosen,et al. A Note on Constant-Round Zero-Knowledge Proofs for NP , 2004, TCC.
[10] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[11] Abhi Shelat,et al. Two-Output Secure Computation with Malicious Adversaries , 2011, EUROCRYPT.
[12] Yehuda Lindell,et al. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries , 2007, Journal of Cryptology.
[13] Rafail Ostrovsky,et al. Black-box non-black-box zero knowledge , 2014, IACR Cryptol. ePrint Arch..
[14] Rafail Ostrovsky,et al. Zero-knowledge from secure multiparty computation , 2007, STOC '07.
[15] Sanjam Garg,et al. The Exact Round Complexity of Secure Computation , 2016, EUROCRYPT.
[16] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[17] 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.
[18] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[19] Iftach Haitner,et al. Semi-honest to Malicious Oblivious Transfer - The Black-Box Way , 2008, TCC.
[20] Amit Sahai,et al. Concurrent zero knowledge with logarithmic round-complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[21] 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.
[22] Mike Rosulek. Must You Know the Code of f to Securely Compute f? , 2012, CRYPTO.
[23] Adi Shamir,et al. Witness indistinguishable and witness hiding protocols , 1990, STOC '90.
[24] E. Kushilevitz,et al. Cryptography in NC/sup 0/ , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[25] Rafail Ostrovsky,et al. Constructing Non-malleable Commitments: A Black-Box Approach , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[26] Hugo Krawczyk,et al. On the Composition of Zero-Knowledge Proof Systems , 1990, ICALP.
[27] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[28] Yehuda Lindell,et al. Efficient Secure Two-Party Protocols: Techniques and Constructions , 2010 .
[29] Jonathan Katz,et al. Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose , 2013, CRYPTO.
[30] Rafail Ostrovsky,et al. Efficient Non-interactive Secure Computation , 2011, EUROCRYPT.
[31] Yehuda Lindell. Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries , 2013, CRYPTO.
[32] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[33] Hoeteck Wee,et al. Black-Box Constructions of Two-Party Protocols from One-Way Functions , 2009, TCC.
[34] Silas Richelson,et al. Textbook non-malleable commitments , 2016, STOC.
[35] Rafail Ostrovsky,et al. Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way , 2015, TCC.
[36] Vipul Goyal,et al. Constant round non-malleable protocols using one way functions , 2011, STOC '11.
[37] Tal Malkin,et al. Simple, Black-Box Constructions of Adaptively Secure Protocols , 2009, TCC.
[38] Yehuda Lindell,et al. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer , 2011, Journal of Cryptology.
[39] Yuval Ishai,et al. Computationally Private Randomizing Polynomials and Their Applications , 2005, Computational Complexity Conference.
[40] Markus Jakobsson,et al. Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function , 1997, EUROCRYPT.
[41] Mihir Bellare,et al. Foundations of garbled circuits , 2012, CCS.
[42] Yehuda Lindell,et al. Efficient Secure Two-Party Protocols , 2010, Information Security and Cryptography.
[43] Rafail Ostrovsky,et al. Round-Optimal Black-Box Two-Party Computation , 2015, CRYPTO.
[44] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.