Abstract
In this paper, we introduce a novel electronic voting protocol which is resistant to more powerful corrupted parties and coercers than any previous works. They can be the voting authorities inside the system who can steal voters' information and the content of their votes, or the adversaries outside who try to buy the votes, and force voters to follow their wishes. The worst case is that the adversaries outside collude with all voting authorities inside to destroy the whole system. In previous works, authors suggested many complicated cryptographic techniques for fulfilling all security requirements of electronic voting protocol. However, they cannot avoid the sophisticated inside and outside collusion. Our proposal prevents these threats from happening by the combination of blind signature, dynamic ballots and other techniques. Moreover, the improvement of blind signature scheme together with the elimination of physical assumptions makes the newly proposed protocol faster and more efficient. These enhancements make some progress towards practical security solution for electronic voting system. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Nguyen, T. A. T., & Dang, T. K. (2013). A practical solution against corrupted parties and coercers in electronic voting protocol over the network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7804 LNCS, pp. 11–20). https://doi.org/10.1007/978-3-642-36818-9_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.