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

In this paper we propose a homomorphic encryption-based secure electronic voting scheme
that is based on [5]. It guarantees eligibility, unreusability, privacy, verifiability and also …

Compared with paper-based voting, electronic voting not only has advantages in storage
and transmission, but also can solve the security problems that exist in traditional voting …

Cryptography is an important tool in the design and implementation of e-voting schemes
since it can provide verifiability, which is not provided in the traditional voting. But in the real …

In this paper, we present an electronic voting (namely e-voting) system based on
cryptographic techniques. Recently, some countries have used the e-voting system using …

All the currently existing homomorphic e-voting schemes are based on additive
homomorphism. In this paper a new e-voting scheme based on multiplicative …

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

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 …

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 …

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 …