VI Preface methods from information theory. Unconditionally secure schemes are now
addressed in an extra chapter, Chapter 10.• Unconditional security is not achievable without …

There have been intensive research efforts in the last two decades or so to design and
deploy electronic voting (e-voting) protocols/systems which allow voters and/or external …

The Australian state of New South Wales (NSW) held their State General Election (SGE) on
28th March 2015. The iVote R electronic voting system was used at this election by eligible …

Democracy depends on the proper administration of popular elections. Voters should
receive assurance that their intent was correctly captured and that all eligible votes were …

A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in
permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets …

Malleability for cryptography is not necessarily an opportunity for attack; in many cases it is a
potentially useful feature that can be exploited. In this work, we examine notions of …

A proof of a shuffle is a zero-knowledge proof that one list of ciphertexts is a permutation and
re-encryption of another list of ciphertexts. We call a shuffle restricted if the permutation is …

We introduce a pre-computation technique that drastically reduces the online computational
complexity of mix-nets based on homomorphic cryptosystems. More precisely, we show that …

Since David Chaum introduced the idea of mix nets 40 years ago, they have become widely
used building blocks for privacy-preserving protocols. Several important applications, such …

We show how to obfuscate a secret shuffle of ciphertexts: shuffling becomes a public
operation. Given a trusted party that samples and obfuscates a shuffle before any ciphertexts …