Author:
Cachin Christian,Micali Silvio,Stadler Markus
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. L. M. Adleman and M.-D. A. Huang, “Recognizing primes in random polynomial time,” in Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 462–469, 1987.
2. Lect Notes Comput Sci;A. Ambainis,1997
3. E. Bach and J. Shallit, Algorithmic Number Theory, vol. 1: Efficient Algorithms. Cambridge: MIT Press, 1996.
4. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson, “Multi prover interactive proofs: How to remove intractability,” in Proc. 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 113–131, 1988.
5. M. Blum, A. De Santis, S. Micali, and G. Persiano, “Noninteractive zeroknowledge,” SIAM Journal on Computing, vol. 20, pp. 1085–1118, Dec. 1991.
Cited by
234 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献