loading...
Secrecy forever? Analysis of Anonymity in Internet-based Voting Protocols
Vienna, Austria April 20-April 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARES.2006.118First International Conference on Ava ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Melanie Volkamer, DFKI GmbH, Saarbrucken, Germany
Robert Krimmer, Institute for Production Management, Vienna
Internet-based elections have become more and more popular in the last five years. In future a lot of people are probably going to cast their ballot over the Internet. This could be a great benefit. But at the same time new possibilities to manipulate the election will arise: Besides other network specific attacks, sniffing of the network traffic becomes interesting. This paper identifies the problems with respect to temporal unlimited election secrecy against sniffing on the network. The problem is the voter?s IP address and the fact that in practice, there is no anonymous communication channel. Thus the voter?s anonymity can be broken in future. However, the attacker will not be able to proof his knowledge about the voter?s decision. We will figure out how this vulnerability could be prevented with state of the art technologies.
Citation:
Melanie Volkamer, Robert Krimmer, "Secrecy forever? Analysis of Anonymity in Internet-based Voting Protocols," ares, pp.340-347, First International Conference on Availability, Reliability and Security (ARES'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.