Non-interactive and reusable non-malleable commitment schemes
暂无分享,去创建一个
[1] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[2] Rafail Ostrovsky,et al. Efficient and Non-interactive Non-malleable Commitment , 2001, EUROCRYPT.
[3] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[4] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[5] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[6] Ivan Damgård,et al. Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor , 2001, CRYPTO.
[7] C. Pomerance,et al. Prime Numbers: A Computational Perspective , 2002 .
[8] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[9] Marc Fischlin,et al. On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function , 2002, CT-RSA.
[10] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[11] 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..
[12] Marc Fischlin,et al. Efficient Non-Malleable Commitment Schemes , 2000, Annual International Cryptology Conference.
[13] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[14] Rafail Ostrovsky,et al. Non-interactive and non-malleable commitment , 1998, STOC '98.
[15] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[16] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..