Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient construction of vote-tags to allow open objection to the tally in electronic elections
Information Processing Letters
Practical multi-candidate election system
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Almost entirely correct mixing with applications to voting
Proceedings of the 9th 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
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Secure Voting Using Partially Compatible Homomorphisms
CRYPTO '94 Proceedings of the 14th 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
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
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
Receipt-Free Electronic Voting Schemes for Large Scale Elections
Proceedings of the 5th International Workshop on Security Protocols
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
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 practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Secret-Ballot Receipts: True Voter-Verifiable Elections
IEEE Security and Privacy
Multi-authority secret-ballot elections with linear work
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A secure and optimally efficient multi-authority election scheme
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
A threshold cryptosystem without a trusted party
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
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
Receipt-free electronic voting scheme with a tamper-resistant randomizer
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Efficient Vote Validity Check in Homomorphic Electronic Voting
Information Security and Cryptology --- ICISC 2008
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
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
TRIMS, a privacy-aware trust and reputation model for identity management systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient multiplicative homomorphic e-voting
ISC'10 Proceedings of the 13th international conference on Information security
A general, flexible and efficient proof of inclusion and exclusion
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
An efficient shuffling based eVoting scheme
Journal of Systems and Software
Verifiable encrypted redundancy for mix-type remote electronic voting
EGOVIS'11 Proceedings of the Second international conference on Electronic government and the information systems perspective
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
A general, flexible and efficient proof of inclusion and exclusion
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
| Hi-index | 0.00 |
All the currently existing homomorphic e-voting schemes are based on additive homomorphism. In this paper a new e-voting scheme based on multiplicative homomorphism is proposed. In the tallying phase, a decryption is performed to recover the product of the votes, instead of the sum of them (as in the additive homomorphic e-voting schemes). Then, the product is factorized to recover the votes. The new e-voting scheme is more efficient than the additive homomorphic e-voting schemes and more efficient than other voting schemes when the number of candidates is small. Strong vote privacy and public verifiability are obtained in the new e-voting scheme.