Author:
Tompa Martin,Woll Heather
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. Proc. 26th IEEE Symp. Found. Comp. Sci., pages 383–395, October 1985.
3. O. Goldreich, S. Micali, and A. Wigderson. How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design. These Proceedings, 1987.
4. S. Goldwasser and J. Killian. Almost all primes can be quickly certified. Proc. 18th Annual ACM Symp. Theory Comput., pages 316–329, May 1986.
5. S. Goldwasser, S. Micali, and R. Rivest. A ‘paradoxical’ solution to the signature problem. Proc. 25th IEEE Symp. Found. Comp. Sci., pages 441–448, October 1984.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献