In this paper, we survey and contribute to the field of secure distributed voting protocols. We begin by examining a series of increasingly sophisticated existing voting protocols, and demonstrate how they move from basic verifiability to add privacy and uncoercibility. We then propose a new protocol which allows a hierarchical voting scheme, which should be more scalable than existing protocols without practically sacrificing any of the other criteria.
This is a final paper for Computer Science 262: Introduction to Distributed Computing, Spring 1997, HarvardUniversity. What's presented below is slightly different from the submitted version, though, in that several bugs have been fixed.