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 …

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

¿¿¿¿¿¿ Pre¿ ta¿ Voter provides a practical approach to end-to-end verifiable elections with
a simple, familiar voter-experience. It assures a high degree of transparency while …

Remote electronic voting, often called online or Internet voting, has been subject to research
for the last four decades. It is regularly discussed in public debates, especially in the context …

We propose AccountTrade, a set of accountable protocols, for big data trading among
dishonest consumers. To secure the big data trading environment, our protocols achieve …

We present Selections, a new cryptographic voting protocol that is end-to-end verifiable and
suitable for Internet voting. After a one-time in-person registration, voters can cast ballots in …

Remote electronic voting has attracted increasing attention in cryptographic research. A
promising protocol presented by Juels et al. is currently widely discussed. Although it offers …

Coercion-resistance is a security property of electronic voting, often considered as a must-
have for high-stake elections. The JCJ voting scheme, proposed in 2005 by Juels, Catalano …

In this paper, a set of accountable protocols denoted as AccountTrade is proposed for big
data trading among dishonest consumers. For achieving a secure big data trading …

Coercion-resistance is the most effective property to fight coercive attacks in Internet
elections. This notion was introduced by Juels, Catalano, and Jakobsson (JCJ) at WPES …