Author:
Brassard Gilles,Laplante Sophie,Crépeau Claude,Léger Christian
Reference15 articles.
1. Babai, L. and S. Moran, “Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes”, Journal of Computer and System Sciences, Vol. 36, 1988, pp. 254–276.
2. Boyar, J., C. Lund, and R. Peralta, “On the communication complexity of zero-knowledge proofs”, manuscript submitted to the Journal of Cryptology, 1989.
3. Brassard, G., “Constant-round perfect zero-knowledge made easy (and efficient)”, manuscript available from the author, 1990.
4. Brassard, G., “Cryptology column — How convincing is your protocol?” Sigact News, in preparation, 1991.
5. Brassard, G., D. Chaum, and C. Crépeau, “Minimum disclosure proofs of knowledge”, Journal of Computer and System Sciences, Vol. 37, no. 2, 1988, pp. 156–189.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Proving Computational Ability;Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation;2011
2. The power of preprocessing in zero-knowledge proofs of knowledge;Journal of Cryptology;1996-06
3. Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer;Advances in Cryptology — CRYPTO ’91;1992
4. On Defining Proofs of Knowledge;Advances in Cryptology — CRYPTO’ 92