• Aucun résultat trouvé

Du-Vote: Remote Electronic Voting with Untrusted Computers

N/A
N/A
Protected

Academic year: 2022

Partager "Du-Vote: Remote Electronic Voting with Untrusted Computers"

Copied!
1
0
0

Texte intégral

(1)

Du-Vote: Remote Electronic Voting with Untrusted Computers

(Invited Talk)

Mark Ryan, Gurchetan Grewal, Michael Clarkson, and Liqun Chen

University of Birmingham, UK m.d.ryan@cs.bham.ac.uk

Abstract. Du-Vote is a new remote electronic voting protocol that elim- inates the often-required assumption that voters trust general-purpose computers. Trust is distributed in Du-Vote between a simple hardware token issued to the voter, the voters’s computer, and a server run by elec- tion authorities. Verifiability is guaranteed with statistically high prob- ability even if all these machines are controlled by the adversary, and privacy is guaranteed as long as at least either the voter’s computer or the server is not controlled by the adversary. The design of the Du-Vote protocol is presented in this paper. A new non-interactive zero-knowledge proof is employed to verify the server’s computations. The security of the protocol is analyzed to determine the extent to which, when components of the system are malicious, privacy and verifiability are maintained.

Keywords: du-vote, electronic voting protocol

Références

Documents relatifs

As one can see, there is only in one case of P r = 0.01, Γ = 1.2 and liquid volume 0.8 that a big discrepancy in the critical Reynolds number was obtained (about 5%). For the case of

Range > Approval > various Condorcet methods among which I make little dif- ference > Two round plurality > Alternative vote > Leximin > Majority JudgmentH.

In all simulations, the transformations converge close to critical points calculated with a Gauss-Newton method for an affine relaxation of the synchronization problem.

This talk focuses on guaranteed state estimation by zonotopes [1], [2] applied to multivariable linear discrete-time systems in the presence of disturbances, noises and

Individual verifiability ensures that a voter can verify that her vote counts correctly, while universal verifiability (first recognised explicit by Sako and Kilian [SK95]) ensures

Other methods such as [6] or [11] are also able to compute guaranteed confidence regions using interval analysis, but the computed set is not of minimal volume and it is difficult

We wish to determine the optimal signal of length N = 500 solving experiment design problem (13) when U is the class of PRBS signals and with a largest admissible modeling error r

This paper extends the conformal prediction framework to rule extraction, making it possible to extract interpretable models from opaque models in a setting where either the