In this paper we present a new multi‐authority secret‐ballot election scheme that guarantees
privacy, universal veriability, and robustness. It is the first scheme for which the performance …

We present new cryptographic protocols for multi-authority secret ballot elections that
guarantee privacy, robustness, and univer-sal verifiability. Application of some novel …

In this paper, we distribute the functions of the government in the cryptographic election
scheme of [CoFi85]. In so doing, we are able to achieve privacy of individual votes in a much …

This paper proposes a practical large scaled secret voting scheme which satisfies the
receipt-free property* as well as the fairness property†. This scheme uses three realistic …

The aim of electronic voting schemes is to provide a set of protocols that allow voters to cast
ballots while a group of authorities collect the votes and output the final tally. In this paper we …

Most voting schemes rely on a number of authorities. If too many of these authorities are
dishonest then voter privacy may be violated. To give stronger guarantees of voter privacy …

We present the first universally verifiable voting scheme that can be based on a general
assumption (existence of a non-interactive commitment scheme). Our scheme is also the first …

This paper presents a novel cryptographic scheme which fully conforms to the requirements
of holding large scale general elections. The participants of the scheme are the voters, the …

This paper improves voters' convenience in the secret-ballot voting scheme offered by
Fujioka, Ohta and Okamoto. In their scheme, all voters have to participate in all stages of the …

Strong voter privacy, although an important property of an election scheme, is usually
compromised in election protocol design in favor of other (desirable) properties. In this work …