Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. M. Blum. How to prove a theorem so no one else can claim it. Proc. of the International Congress of Mathematicians, pages 1444–1451, Berkeley, California, U.S.A., 1987.
2. Lect Notes Comput Sci;C. Blundo,1992
3. A. De Santis, G. Di Crescenzo, O. Goldreich, G. Persiano. The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof. Information Processing Letters
69(4): 201–206, 1999.
4. Lect Notes Comput Sci;Y. Desmedt,1999
5. D. Dolev. The Byzantine generals strike again. J. of Algorithms, 3:14–30, 1982.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献