Abstract
A number of drawbacks in previous electronic voting schemes are analyzed in this paper. A new voting protocol is proposed. As results, giving up voting rights is allowed, low computational complexity is achieved and wide application is embodied. In the end, the security of the protocol is proved.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35515-3_53
Chapter PDF
Similar content being viewed by others
Reference
J.Cohen and M.Fischer. A robust and verifiable cryptographically secure election scheme. In proc. 26th IEEE Symposium on Foundation of Computer Science (FOCS’85), pp 372–382. IEEE Computer Society, 1985.
J. Benaloh and M.Yung. Distribution the power of a government to enhance the privacy of voters. In Proc. 5th ACM Symposium on Principles of Distributed Computing (PODC’86), pp52–62, New York,1986. A.C.M.
J.Benaloh. Verifiable Secret-Ballot Elections. Ph.D. thesis, Yale University, Department of Computer Science Department, New Haven, CT, September 1987.
J. Benaloh and D.Tuintra. Receipt-free secret-ballot elections. In Proc. 26th Symposium on Theory of Computing (STOC’94), pp544–553, New York, 1994. A.C.M.
R.Cramer, M.Fraklin, B.Schoenmakers, and M.Yung. Multi-authority Secret ballot elections with linear work. In Advance in Cryptology-EUROCRYPT’96, Volume 1070 of Lecture Notes in Computer Science, pp72–83,Berlin, 1996. Springer-verlag.
A.Fiat and A.Shamir. How to proof yourself: Practical solutions to identification and signature problems. In Advances in Cryptology-CRYPTO’86, Volume 263 of Lecture Notes in Computer Science, pp186–194,New York, 1987. Springverlag.
R.Gennaro. Achieving independence efficiently and securely. In Proc. 14th ACM Symposium on Principles of Distributed Computing (PODC’95), New York, 1995. A.C.M.
D.Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, 24 (2): 84–88, 1981.
R.Cramer, R.Gennaro and B. Schoenmakes, A secure and Optimally Efficient Multi-Authority Election Scheme, Advances in Cryptology-Eurocrypt’97,pp103118, Springer-Verlag.
K. Sako and J.Kilian, Secure Voting Using Partially Compatible Homomorphisms, Advances in Cryptology-Crypto’94, pp411–424, Springer-Verlag.
Fujioka,A., Okamoto,T., Ohta,K., A pracatical secret voting scheme for large scale elections, Advances in Cryptology-Ausocrypt’92, Spring-verlag, 1993, pp. 244–251.
Schneier, B., Applied Cryptography: Protocols, Algorithms, and Source Code in C, John Wiley * Sons, New York, 2nd Edition,1996.
Naor,M., Bit Commitment Using Pseudo-randomness,Advances in Cryptology-Crypt’ 89, Springer-verlag, 1990,pp 128–136.
Brassoud,G.,Chaum,D., Crepeau,C., Minimum Disclosure Proofs of Knowledge,Journal of Computer and System Science, 37 (1988), pp 156–189.
C.Park, K. Itoh, and K. Kurosawa, Efficient Anonymous Channel and all/Nothing Election Scheme, Advances in Cryptology- Eurocrypt’93, Springerverlag, 1994, pp 248–259
D. Chaum and T.P. Pedersen, Wallet databases with observers, In Advances in Cryptology-Eurocrypt’90, Volume 473 of Lecture Notes in Computer Science, pp89–105, Berlin,1993, Springer-verlag.
Y. Frankel, Y. Tsiounis and M. Yung, Fair Off-line e-cash Made easy, advances in Cryptology-Asiacrypt’98, LNCS 1514, pp 257–270, Beijing, 1998, Springer-verlag.
D. Pointcheval and J. Stern, Provably Secure Blind Signature Scheme, Advances in Cryptology-Asiacrypt’96,Lecture Notes in Computer Science 1163, pages 252–265, November 3–7, South Korea.
C.P. Schnorr, Efficient Identification and Signature for Smart Cards. In GBrassard, Editor, Advances in Cryptology-Proceedings of Crypto’89, LNCS 435, pp 235–251, Springer-verlag.
F. Bao and R. Deng, An Efficient Fair Exchange Protocol with an Off-line Semi- Trusted Third Party, The International Workshop on Cryptographic Technique * E -Commerce, M. Blum and C.H.Lee, Editors, pp37–4’7, City University of HongKong Press, Hongkong
R.Canetti, O.Goldreich and S.Halevi, The random oracle methodology, revisit, in he proceedings of STOC’98.
Chun-I, Fan and Chin-Laung Lei, A Multi-recastable Ticket Scheme For Electronic Election, Advances in Cryptology-Asiacrypt’96,Lecture Notes in Computer Science 1163, pages 117–124, November 3–7, South Korea.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 IFIP International Federation for Information Processing
About this paper
Cite this paper
Jiang, S., Feng, D., Qing, S. (2000). Analysis and Design of E-voting Protocol. In: Qing, S., Eloff, J.H.P. (eds) Information Security for Global Information Infrastructures. SEC 2000. IFIP — The International Federation for Information Processing, vol 47. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35515-3_29
Download citation
DOI: https://doi.org/10.1007/978-0-387-35515-3_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5479-7
Online ISBN: 978-0-387-35515-3
eBook Packages: Springer Book Archive