Author:
Tompa Martin,Woll Heather
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference10 articles.
1. L. M. Adleman and M.-D. A. Huang, Recognizing primes in random polynomial time,Proc. 19th Annual ACM Symp. Theory Comput., pp. 462–469, May 1987.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
3. Lecture Notes in Computer Science;J. C. Benaloh,1987
4. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults,Proc. 26th Symp. Found. Comp. Sci., pp. 383–395, October 1985.
5. P. Feldman, A practical scheme for noninteractive verifiable secret sharing,Proc. 28th Symp. Found. Comp. Sci., pp. 427–437, October 1987.
Cited by
146 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献