Constant-round non-malleable commitments from any one-way function
暂无分享,去创建一个
[1] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[2] Rafael Pass,et al. Non-malleability amplification , 2009, STOC '09.
[3] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[4] Rafael Pass,et al. Bounded-concurrent secure multi-party computation with a dishonest majority , 2004, STOC '04.
[5] Adi Shamir,et al. Witness indistinguishable and witness hiding protocols , 1990, STOC '90.
[6] Hoeteck Wee,et al. Black-Box Constructions of Two-Party Protocols from One-Way Functions , 2009, TCC.
[7] Rafael Pass,et al. Concurrent Non-malleable Commitments from Any One-Way Function , 2008, TCC.
[8] Michael O. Rabin,et al. Achieving independence in logarithmic number of rounds , 1987, PODC '87.
[9] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[10] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[11] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[12] Manuel Blum,et al. Coin flipping by telephone a protocol for solving impossible problems , 1983, SIGA.
[13] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[14] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[15] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[16] 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.
[17] Russell Impagliazzo,et al. One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.
[18] Rafael Pass,et al. A unified framework for concurrent security: universal composability from stand-alone non-malleability , 2009, STOC '09.
[19] Ivan Damgård,et al. Non-interactive and reusable non-malleable commitment schemes , 2003, STOC '03.
[20] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[21] Rafail Ostrovsky,et al. Efficient and Non-interactive Non-malleable Commitment , 2001, EUROCRYPT.
[22] Hoeteck Wee,et al. Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions , 2010, EUROCRYPT.
[23] Romain Michon,et al. The Black Box , 2013, NIME.
[24] 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).
[25] Rafael Pass,et al. Concurrent non-malleable commitments , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[26] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[27] Rafael Pass,et al. Concurrent Non-Malleable Zero Knowledge Proofs , 2010, CRYPTO.
[28] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[29] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[30] Rafail Ostrovsky,et al. Round Efficiency of Multi-party Computation with a Dishonest Majority , 2003, EUROCRYPT.
[31] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[32] Vinod Vaikuntanathan,et al. Adaptive One-Way Functions and Applications , 2008, CRYPTO.
[33] Tal Malkin,et al. Simple, Black-Box Constructions of Adaptively Secure Protocols , 2009, TCC.
[34] 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..
[35] Marc Fischlin,et al. Efficient Non-Malleable Commitment Schemes , 2000, Annual International Cryptology Conference.
[36] Rafael Pass,et al. New and improved constructions of non-malleable cryptographic protocols , 2005, STOC '05.
[37] Vipul Goyal,et al. Constant round non-malleable protocols using one way functions , 2011, STOC '11.
[38] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[39] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[40] Ran Canetti,et al. Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.