International audienceThe 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 describe a practical multi-candidate election scheme that guarantees privacy of voters, public verifiablity and robustness against a coalition of malicious authorities. Furthermore, we address the problem of receipt-freeness and incoercibility of voters. Our new scheme is based on the Paillier cryptosystem and on some related zero-knowledge proof techniques. The voting schemes are very practical and can be efficiently implemented in a real system
Restricting our discussion to the Yes/No-voting schemes which offer a choice between two options, in...
We present a voting protocol that protects voters’ privacy and achieves universal verifiability, rec...
In this paper a new electronic voting scheme is described which guarantees coercion-resistance as we...
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy...
. In this paper we present a new multi-authority secret-ballot election scheme that guarantees priva...
[[abstract]]In this paper, we propose a robust and verifiable multi-authority secret voting scheme w...
In this paper, we propose a robust and verifiable multi-authority secret voting scheme which meets t...
Abstract. We present the first universally verifiable voting scheme that can be based on a general a...
A number of voter-verifiable electronic voting schemes have been introduced in the recent decades. T...
In this chapter, we present a methodology for proving in Zero Knowledge the validity of selecting a ...
The voting plays important roles in a democratic country. Due to the problems of the existed voting ...
Abstract. This paper presents a novel unifying framework for electronic voting in the universal comp...
This paper presents a novel secret voting scheme which fully conforms to the requirements of large s...
"Voter verifiability" is a notion offered by some electronic voting schemes, which develops into an ...
An Internet voting scheme allows voters to cast their votes or ballots over Internet. Several inform...
Restricting our discussion to the Yes/No-voting schemes which offer a choice between two options, in...
We present a voting protocol that protects voters’ privacy and achieves universal verifiability, rec...
In this paper a new electronic voting scheme is described which guarantees coercion-resistance as we...
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy...
. In this paper we present a new multi-authority secret-ballot election scheme that guarantees priva...
[[abstract]]In this paper, we propose a robust and verifiable multi-authority secret voting scheme w...
In this paper, we propose a robust and verifiable multi-authority secret voting scheme which meets t...
Abstract. We present the first universally verifiable voting scheme that can be based on a general a...
A number of voter-verifiable electronic voting schemes have been introduced in the recent decades. T...
In this chapter, we present a methodology for proving in Zero Knowledge the validity of selecting a ...
The voting plays important roles in a democratic country. Due to the problems of the existed voting ...
Abstract. This paper presents a novel unifying framework for electronic voting in the universal comp...
This paper presents a novel secret voting scheme which fully conforms to the requirements of large s...
"Voter verifiability" is a notion offered by some electronic voting schemes, which develops into an ...
An Internet voting scheme allows voters to cast their votes or ballots over Internet. Several inform...
Restricting our discussion to the Yes/No-voting schemes which offer a choice between two options, in...
We present a voting protocol that protects voters’ privacy and achieves universal verifiability, rec...
In this paper a new electronic voting scheme is described which guarantees coercion-resistance as we...