Abstract
This paper presents the security requirements and the system wide properties that the voting protocol of an electronic voting system is expected to fulfil. Then, an overview of the existing voting protocols, together with a brief analysis of their characteristics, is provided. The aim is to investigate and discuss the extent to which current voting protocols comply with the identified requirements and thus examine the feasibility of organising and conducting an Internet based election in a secure, efficient and reliable way.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Benaloh J., “Verifiable secret-ballot elections”, Ph.D. Dissertation, Yale University, YALEU/CDS/TR-561, December 1987.
Baudron O., Fouque P., Pointcheval D., Poupard G., “Practical multi-candidate election system”, in Proc. of the 20 th ACM Symposium on Principles of Distributed Computing, August 2001, USA, pg. 274–283, ACM Press.
Baraani A., Pieprzyk J., Safavi R., “A Practical electronic voting protocol using threshold schemes”, Centre for Computer Security Research, Dept. of Computer Science, University of Wollongong, Australia, May 1994.
Benaloh J., Tuinstra D., “Receipt-free secret-ballot elections”, Clarkson University, 1994.
Benaloh J., Yung M., “Distributing the power of a Government to enhance the privacy of votes”, in Proc. of the 5th ACM Symposium on Principles of Distributed Computing, pg. 52–62, August 1986.
Cohen J., Fischer M., “A robust and verifiable cryptographically secure election scheme”, in 26th Annual Symposium on Foundations of Computer Science, IEEE Press, pg. 372–382, October 1985.
Cramer R., Franklin M., Schöenmakers B., Yung M., “Multi-authority secret-ballot elections with linear work”, in Advances in Cryptology — EUROCRYPT’95, LNCS 1070, pg. 72–83, Springer-Verlag, May 1996.
Cramer R., Gennaro R., Schöenmakers B., “A secure and optimally efficient multi-authority election scheme”, in Proc. of EUROCRYPT’97, Germany, Springer-Verlag, LNCS 1233, pg. 103–118.
Damgård I., Jurik M., “Efficient protocols based on probabilistic encryption using composite degree residue classes”, RS-00–5, Dept. of Computer Science, University of Aarhus, March 2000.
Damgård I., Jurik M., “A generalisation, a simplification and some applications of Paillier’s probabilistic public-key system”, in Proc. of the Fourth International Workshop on Practice and Theory in Public Key Cryptography,LNCS 1992, 2001, pg. 119–136.
Fujioka A., Okamoto T., Ohta K., “A practical secret voting scheme for large-scale elections”, in Advances in Cryptology, Proceedings of AUSCRYPT’92, LNCS 718, pg. 244–251, Springer-Verlag, 1992.
Hirt M., Sako K., “Efficient receipt-free voting based on homomorphic encryption”, Theory and Application of Cryptographic Techniques, pg. 539–556, 2000.
Kiong N., “Electronic election”, Proceedings of ITSim 2000.
Karro J., Wang J., “Towards a practical, secure and very large-scale online election”, in Proc. of the 15th Annual Computer Security Applications Conference, IEEE Press, USA, 1998.
Magkos E., Burmester M., Chrissikopoulos V., “Receipt-freeness in large-scale elections without untappable channels”,inProc. of the l st IFIP Conference on ECommerce/E-Business/E-Government,Zurich, October 2001, Kluwer Academic Publishers,pg.683–693,2001.
Mitrou L., Gritzalis D., Katsikas S., “Revisiting legal and regulatory requirements for secure e-voting”, in Proc. of the 17 th IFIP International Information Security Conference, pg. 469–480, Egypt 2002.
Mirk O., “Electronic voting schemes”, Semester Work, Tartu University, 2000.
Ikonomopoulos S., Lambrinoudakis C., Gritzalis D., Kokolakis S., Vassiliou K., “Functional requirements for a secure electronic voting system”, in Proc. of the 17 th IFIP International Information Security Conference, pg. 507–520, Egypt 2002.
Paillier P., “Public-key cryptosystems based on discrete logarithms residues”, in EUROCRYPT’99, LNCS 1592, Springer- Verlag, 1999.
Riera A., Borell J., Rifà J., “An uncoercible verifiable electronic voting protocol”, in Proc. of the IFIP International Information Security Conference, Vienna-Budapest, pg. 206–215,1998.
Riera A., “An introduction to electronic voting schemes”, Unitat de Combinatória i de Comunicació Digital, Universitat Autónoma de Barcelona, 1998.
Schöenmakers B., “A simple publicly verifiable secret sharing scheme and its application to electronic voting”, in Advances in Cryptology - CRYPTO’99, LNCS 1666, pg. 148–164, Springer-Verlag 1999.
Yung A., Young M., “A PVSS as hard as discrete log and shareholder separability”, in Proc. of 4th International Workshop on Practice and Theory in Public Key Cryptosystems, Korea, LNCS 1992, p. 287, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lambrinoudakis, C., Gritzalis, D., Tsoumas, V., Karyda, M., Ikonomopoulos, S. (2003). Secure Electronic Voting: the Current Landscape. In: Gritzalis, D.A. (eds) Secure Electronic Voting. Advances in Information Security, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0239-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0239-5_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4981-5
Online ISBN: 978-1-4615-0239-5
eBook Packages: Springer Book Archive