Secure Electronic Voting

  title={Secure Electronic Voting},
  author={Dimitris Gritzalis},
  booktitle={Advances in Information Security},
  • D. Gritzalis
  • Published in
    Advances in Information…
  • Computer Science
Contributing Authors. Preface. Part I: Setting the Scene. 1. Evaluation of voting technologies D. Jones. 2. In search of the perfect voting technology: No easy answers L.F. Cranor. 3. Verification for electronic balloting systems R. Mercuri, P. Neumann. 4. Electronic voting: Constitutional and legal requirements, and their technical implications L. Mitrou, D. Gritzalis, S. Katsikas, G. Quirchmayr. Part II: Trends and Perspectives. 5. Towards secure and practical e-elections in the new era M… 

A Realistic Secure On-line E-Voting System

This paper describes an on-line e-voting system security implementation to reduce attacks with the help of time stamping and hash function and develops a model for describing the real life environment where voting takes place and analyze the behavior of rational adversaries.

The Witness-Voting System

  • Ed Gerck
  • Computer Science
    Towards Trustworthy Elections
  • 2010
A new, comprehensive framework to qualitatively improve election outcome trustworthiness is presented, where voting is modeled as an information transfer process, with a provably optimal design that is applicable to any type of voting, with or without ballots.

Securing a Scalable E-Voting System Using the RSA Algorithm: The Case of a Group Voting Process in a Tertiary School

This paper shows that RSA (Ron Rivest, Adi Shamir and Leonard Adleman) cryptography algorithm can be incorporated into E-voting process as a whole and ensures that votes casted are secured, thus maintaining the privacy of votes.

The Vector-Ballot e-Voting Approach

The goal is to suggest a new ”vector-ballot” based approach for secret-Ballot e-voting that is based on three new notions: Provably Consistent Vector Ballot Encodings, Shrink-and-Mix Networks and Punch-Hole-Vector-Ballots.

E-Voting Security Protocol: Analysis & Solution

A model for describing the real life environment where voting takes place and analyze the behavior of rational adversaries is developed, which is more developed than Secure Electronic Registration and Voting Experiment (SERVE) and the recent e-voting systems.


The purpose of the discussion below is to further elaborate the arguments on both sides and to consider improved mechanisms that would increase voter confidence in the results produced by DRE voting machines.

An Analysis of Chaum's Voter-Verifiable Election Scheme

An analysis of Chaum's Voter-Verifiable election scheme finds the scheme to be secure, but recognizes various minor obstacles limiting its widespread adoption in today’s elections.

An Internet Voting System Supporting User Privacy

The Adder system is a fully functional e-voting platform which enjoys a number of security properties, such as robustness, trust distribution, ballot privacy, auditability and verifiability, and can readily implement and carry out various voting procedures in parallel.

A secure e-Government's e-voting system

This paper proposed a reliable cost effective secure electronic voting system that can be used in cost effectively way in many development countries like Egypt proving that it satisfies privacy, accuracy, reusability, eligibility and integrity.

New Applied E-voting System

This paper introduces on electronic voting system, that have security context or known as e-trusted voting system that provides security and trusted electronic voting.



Efficient Receipt-Free Voting Based on Homomorphic Encryption

The security of the multi-authority voting protocol of Benaloh and Tuinstra is analyzed and it is demonstrated that this protocol is not receiptfree, opposed to what was claimed in the paper and was believed before.

Elections Online: Assessing Internet Voting in Light of the Arizona Democratic Primary

The public furor surrounding the Florida vote count in the recent presidential election has focused attention on election administration and the need for reform. Mistakes by voters due to confusing

Towards a practical, secure, and very large scale online election

  • Jared KarroJie Wang
  • Computer Science
    Proceedings 15th Annual Computer Security Applications Conference (ACSAC'99)
  • 1999
It is shown that even if all voters follow the Sensus protocol honestly, some voters' votes may still be replaced with different votes without being detected, and the proposed protocol overcomes these drawbacks.

Fully auditable electronic secret-ballot elections

This paper shows how special-purpose cryptographic protocols help to achieve the goal of guaranteeing voters’ privacy and integrity of the election result at the same time.

Compensating for a lack of transparency

The fundamental problem of achieving accuracy and ballot secrecy at the same time|assuming it is agreed that ballot secrecy is an essential ingredient for achieving democracy is looked at.

Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth

This work presents a receipt-free voting scheme based on a mixtype anonymous channel, where the sole physical assumption is the existence of a private channel through which the center can send the voter a message without fear of eavesdropping.

A verifiable secret shuffle and its application to e-voting

  • C. A. Neff
  • Computer Science, Mathematics
    CCS '01
  • 2001
A mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers is presented, and its application to secure, universally verifiable, multi-authority election schemes is discussed and shown to be honest-verifier zeroknowledge in a special case and in general.

Efficient Anonymous Channel and All/Nothing Election Scheme

An efficient computationally secure anonymous channel which has no problem of ciphertext length expansion is presented which improves the efficiency of Chaum's election scheme based on the MIX net automatically.

Efficient Proofs that a Committed Number Lies in an Interval

This paper presents a new proof, which is both efficient and exact, for proving that a committed number lies in a specific interval.

Secret ballot elections in computer networks