In this paper we present a new, two-centered electronic voting scheme that is capable of
preserving privacy, universal verifiability, and robustness. An interesting property of our …

Extensive studies have been made on electronic voting in the last twenty years, and many
schemes have been proposed, in which both security and effectiveness have been …

Electronic online voting has become one of the most popular activities over Internet recently,
since it can be performed in a way that is more convenient, faster and cheaper. Security and …

We solve an 18 year open problem on e-voting. While most research on e-voting is focused
on MIX servers, or on homomorphic encryption based schemes, or on blind signatures …

A number of voter-verifiable electronic voting schemes have been introduced in the recent
decades. These schemes not only provide each voter with a receipt without the threat of …

Electronic voting schemes can be divided into homomorphism encryption and anonymous
channel based schemes. The former type requires massive communications and …

Voting schemes that provide receipt-freeness prevent voters from proving their cast vote,
and hence thwart vote-buying and coercion. We analyze the security of the multi-authority …

In the literature, voting protocols are considered secure if they satisfy requirements such as
privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting protocol …

We design new encryption mechanisms that enable the design of the first universally
verifiable voting schemes, supporting both receipt-freeness and everlasting privacy without …

Background A receipt-free electronic voting scheme is proposed by using the techniques of
homomorphic ElGamal encryption, threshold encryption and proof of knowledge. It …