Efficient anonymous channel and all/nothing election scheme
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Communications of the ACM
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
Mix and Match: Secure Function Evaluation via Ciphertexts
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Security Analysis of Electronic Business Processes
Electronic Commerce Research
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
Privacy and e-commerce: a consumer-centric perspective
Electronic Commerce Research
Protocol completion incentive problems in cryptographic Vickrey auctions
Electronic Commerce Research
Secure electronic bills of lading: blind counts and digital signatures
Electronic Commerce Research
Resistance to change: six reasons why businesses don't use e-signatures
Electronic Commerce Research
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 an internet voting protocol which satisfies desired security requirements of electronic voting. In the newly proposed protocol, we allow the adversaries to get more power than in any previous works. They can be coercers or vote buyers outside, and corrupted parties inside our system. These adversaries also have ability to collude with each other to ruin the whole system. Our main contribution is to design an internet voting protocol which is unsusceptible to most of sophisticated attacks. We employ the blind signature technique and the dynamic ballots instead of complex cryptographic techniques to preserve privacy in electronic voting. Moreover, we also aim at the practical system by improving the blind signature scheme and removing physical assumptions which have often been used in the previous works.