An improved electronic voting scheme without a trusted random number generator

Authors:
Yining Liu;Peiyong Sun;Jihong Yan;Yajun Li;Jianyu Cao
Affiliations:
School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin, China;School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin, China;School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin, China;School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin, China;School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin, China
Venue:
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Year:
2011

Citing 11
Cited 0

Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
How to share a secret

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
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking

Proceedings of the 11th USENIX Security Symposium
Scantegrity II: end-to-end verifiability for optical scan election systems using invisible ink confirmation codes

EVT'08 Proceedings of the conference on Electronic voting technology
Enhancing electronic voting machines on the example of Bingo voting

IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Multi-authority secret-ballot elections with linear work

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Bingo voting: secure and coercion-free voting using a trusted random number generator

VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
A practical voter-verifiable election scheme

ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Receipt-free universally-verifiable voting with everlasting privacy

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bingo Voting uses trusted random number generator to realize the correctness and coercion-free. If the trusted random number generator is corrupted, the whole scheme is dangerous, which make it a security bottleneck. With the method of verifiable random number based on interpolating polynomial over Fp, an improved electronic voting scheme is proposed, which not only inherits the good properties of Bingo Voting, but also eliminates the dependence of the trusted random number generator. With the receipt, voter can verify whether the content of vote meets his aspiration or not, but he can not prove to others whom he has vote. The improved e-voting scheme based on verifiable random number that is fair, verifiable, and untraceable can efficiently prevent from colluding and buying vote.