A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Evaluating Security of Voting Schemes in the Universal Composability Framework
[chapter]
2004
Lecture Notes in Computer Science
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting protocol with respect to all these requirements and it is not clear that the list of known requirements is complete. Perhaps because of this many papers on electronic voting do not offer any security proof at all. As a solution to this, we suggest evaluating voting schemes in the universal composability framework. We
doi:10.1007/978-3-540-24852-1_4
fatcat:bby3qg77pne6jmwlr7ypi5rcp4