Efficient anonymous channel and all/nothing election scheme
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Practical multi-candidate election system
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
An Efficient Scheme for Proving a Shuffle
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient Generation of Shared RSA Keys (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Cryptographic Counters and Applications to Electronic Voting
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Practical Threshold RSA Signatures without a Trusted Dealer
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Mix-Networks on Permutation Networks
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: 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
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Proceedings of the 11th USENIX Security Symposium
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 Verifiable Secret Shuffle of Homomorphic Encryptions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Proceedings of the 11th ACM conference on Computer and communications security
International Journal of Information Security
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Secure distributed key generation for discrete-log based cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient receipt-free voting based on homomorphic encryption
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Flaws in some robust optimistic mix-nets
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Verifiable shuffle of large size ciphertexts
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Receipt-free electronic voting scheme with a tamper-resistant randomizer
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
A sender verifiable mix-net and a new proof of a shuffle
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Simple and efficient shuffling with provable correctness and ZK privacy
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Multiplicative homomorphic e-voting
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Hi-index | 0.00 |
Abstract: Among the two popular solutions to electronic voting, homomorphic tallying and shuffling, the latter employs a simpler vote format, is more efficient (especially for the voters) and practical. However, the existing shuffling-based eVoting schemes still have two drawbacks: low efficiency in large-scale applications (especially for the talliers) and weak robustness. In this paper, a novel shuffling protocol is proposed and a new eVoting scheme is designed based on it. The shuffling protocol modifies the shuffling scheme in Crypto 2005, optimising its encryption algorithm and parameter setting, improving its efficiency and overcoming its drawbacks. Thus an efficient shuffling protocol suitable for eVoting is obtained. In the second half of the paper, a delicate application of the shuffling protocol to eVoting is designed such that robustness is strengthened and efficiency is improved.