Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Practical multi-candidate election system
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Coercion-resistant electronic elections
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
A Practical Verifiable e-Voting Protocol for Large Scale Elections over a Network
ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
A formal treatment of onion routing
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
A new approach towards coercion-resistant remote e-voting in linear time
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
| Hi-index | 0.00 |
In this paper, we introduce a novel internet voting protocol which satisfies all desired security requirements of electronic voting system. The main contribution of the newly proposed protocol is the ability to debate more powerful adversaries than any previous works. In particularly, they can force voters to follow their wish, collude with one or more voting authorities to get the contents of votes or to destroy the voting system. To against these kinds of adversaries, blind signature and dynamic ballots techniques are employed instead of complex cryptographic one such as homomorphic encryption and mix-net. Moreover, we also aim at a practical system by improving the blind signature scheme and removing physical assumptions. Finally, with blind signature and dynamic ballots, we will present an enhancement of protocol which is unsusceptible to most of sophisticated attacks.