Constant-Round Concurrent Non-Malleable Commitments and Decommitments
暂无分享,去创建一个
[1] Rafail Ostrovsky,et al. Concurrent Non-Malleable Witness Indistinguishability and its Applications , 2006, Electron. Colloquium Comput. Complex..
[2] 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..
[3] Marc Fischlin,et al. Efficient Non-Malleable Commitment Schemes , 2000, Annual International Cryptology Conference.
[4] Rafael Pass,et al. New and improved constructions of non-malleable cryptographic protocols , 2005, STOC '05.
[5] Manuel Blum,et al. How to Prove a Theorem So No One Else Can Claim It , 2010 .
[6] Rafail Ostrovsky,et al. Efficient and Non-interactive Non-malleable Commitment , 2001, EUROCRYPT.
[7] Adi Shamir,et al. Witness indistinguishable and witness hiding protocols , 1990, STOC '90.
[8] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[9] Silvio Micali,et al. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[10] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[11] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[12] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[13] Ivan Damgård,et al. Non-interactive and reusable non-malleable commitment schemes , 2003, STOC '03.
[14] Amit Sahai,et al. Concurrent Non-Malleable Zero Knowledge , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[15] Rafail Ostrovsky,et al. Non-interactive and non-malleable commitment , 1998, STOC '98.
[16] Manuel Blum,et al. Coin Flipping by Telephone. , 1981, CRYPTO 1981.
[17] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[18] Rafael Pass,et al. Concurrent non-malleable commitments , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[19] Moni Naor,et al. Concurrent zero-knowledge , 2004, JACM.
[20] Rafail Ostrovsky,et al. Robust Non-interactive Zero Knowledge , 2001, CRYPTO.
[21] Adi Shamir,et al. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions , 1999, SIAM J. Comput..