Bibliography

1

J. Cohen and M. Fischer. A robust and verifiable cryptographically secure election scheme. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 372-382, Portland, OR, October 1985.

2

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 Principles of Distributed Computing, pages 52-62, Calgary, AB, August 1986.

3

J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. In Proceedings of the 26th ACM Symposium on the Theory of Computing, pages 544-553, Montreal, Quebec, May 1994.

4

F. Wu. Secure Distributed Computation and Uncoercible Election Schemes. Computer science senior thesis, Harvard University, Cambridge, MA, April 1996.