Author:
Bellare Mihir,Goldreich Oded
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. D. Beaver, and J. Feigenbaum, “Hiding Instances in Multioracle Queries,” Proc. of the 7th STACS, 1990, pp. 37–48.
2. M. Bellare, S. Micali and R. Ostrovsky, “The True Complexity of Statistical Zero-Knowledge,” Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, ACM (1990), pp. 494–502.
3. G. Brassard, D. Chaum, and C. Crépeau, “Minimum Disclosure Proofs of knowledge,” JCSS, Vol. 37, No. 2, 1988, pp. 156–189.
4. J. Boyar, C. Lund and R. Peralta, “On the Communication Complexity of Zero-Knowledge Proofs.” 1989.
5. G. Brassard, C. Crépeau, S. Laplante and C. Léger, “Computationally Convincing Proofs of Knowledge,” Proc. of the 8th STACS, 1991.
Cited by
210 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献