CONTENTS 8.1 Introduction....................................................... 174 8.2 Security Properties of
Voting Systems.............................. 1768.2. 1 Vote Privacy.............................................. 176 8.2. 2 …

One of the most challenging aspects in computer-supported voting is to combine the
apparently conflicting requirements of privacy and verifiability. On the one hand, privacy …

Abstract The Fiat-Shamir transformation is the most efficient construction of non-interactive
zero-knowledge proofs. This paper is concerned with two variants of the transformation that …

Based on the blockchain, homomorphic ElGamal encryption and ring signature, an
electronic voting scheme based on blockchain is proposed for large-scale voting, which has …

This paper presents a major overhaul of one the most widely used symbolic security protocol
verifiers, ProVerif. We provide two main contributions. First, we extend ProVerif with lemmas …

We critically survey game-based security definitions for the privacy of voting schemes. In
addition to known limitations, we unveil several previously unnoticed shortcomings …

End-to-end verifiable voting schemes typically involve voters handling an encrypted ballot in
order to confirm that their vote is accurately included in the tally. While this may be …

Most electronic voting schemes aim at providing verifiability: voters should trust the result
without having to rely on some authorities. Actually, even a prominent voting system like …

Automated verification has become an essential part in the security evaluation of
cryptographic protocols. Recently, there has been a considerable effort to lift the theory and …

Real-World Electronic Voting: Design, Analysis and Deployment captures all major
developments in electronic voting since 2003 in a real-world setting. It covers three broad …