Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
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
Optimistic Mixing for Exit-Polls
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Self-tallying Elections and Perfect Ballot Secrecy
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
A robust and verifiable cryptographically secure election scheme
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Correction, Optimisation and Secure and Efficient Application of PBD Shuffling
Information Security and Cryptology
Simple and efficient hash-based verifiable mixing for remote electronic voting
Computer Communications
Verifiable shuffle of large size ciphertexts
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Multiplicative homomorphic e-voting
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
| Hi-index | 0.00 |
In this paper we present a mix-type remote electronic voting system belonging to the "proof of product with redundancy" paradigm. Votes are composed using a redundancy system that permits to prove the correct composition and plaintext awareness of votes at vote reception and check the validity of the mixing operation while preventing some privacy or denial of service attacks that were possible in previous proposals in the literature.