Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. L. Adleman and K. McCurley. Open Problems in Number Theoretic Complexity. In Discrete Algorithms and Complexity, pages 237–262. Academic Press, Inc., 1987.
2. J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, USA, September 1987. YALEU/DCS/TR-561.
3. Lect Notes Comput Sci;C. Boyd,1988
4. Lect Notes Comput Sci;C. Boyd,1990
5. J. Benaloh and M. Yung. Distributing the Power of a Government to Enhance the Privacy of Voters. In Proceedings of the 5th ACM Symposium on the Principles in Distributed Computing, pages 52–62, 1986.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献