Breaking the Three Round Barrier for Non-malleable Commitments
暂无分享,去创建一个
[1] Vipul Goyal,et al. Block-wise Non-Malleable Codes , 2016, IACR Cryptol. ePrint Arch..
[2] Moni Naor,et al. Non-Malleable Cryptography (Extended Abstract) , 1991, STOC 1991.
[3] Rafail Ostrovsky,et al. Constructing Non-malleable Commitments: A Black-Box Approach , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[4] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[5] Rafael Pass,et al. Constant-round non-malleable commitments from any one-way function , 2011, STOC '11.
[6] Rafael Pass,et al. Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments , 2013, computational complexity.
[7] Silas Richelson,et al. Textbook non-malleable commitments , 2016, STOC.
[8] 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.
[9] Rafail Ostrovsky,et al. Non-interactive and non-malleable commitment , 1998, STOC '98.
[10] Silas Richelson,et al. An Algebraic Approach to Non-malleability , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[11] Vipul Goyal,et al. Constant round non-malleable protocols using one way functions , 2011, STOC '11.
[12] Rafael Pass,et al. New and Improved Constructions of Nonmalleable Cryptographic Protocols , 2008, SIAM J. Comput..
[13] Marc Fischlin,et al. Efficient Non-malleable Commitment Schemes , 2000, Journal of Cryptology.
[14] Boaz Barak,et al. Constant-round coin-tossing with a man in the middle or realizing the shared random string model , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[15] Rafael Pass,et al. New and improved constructions of non-malleable cryptographic protocols , 2005, STOC '05.
[16] Rafael Pass,et al. Bounded-concurrent secure multi-party computation with a dishonest majority , 2004, STOC '04.