Security Proofs for Participation Privacy, Receipt-Freeness, Ballot Privacy, and Verifiability Against Malicious Bulletin Board for the Helios Voting Scheme
نویسندگان
چکیده
The Helios voting scheme is well studied including formal proofs for verifiability and ballot privacy. However, depending on its version, the scheme provides either participation privacy (hiding who participated in the election) or verifiability against malicious bulletin board (preventing election manipulation by ballot stuffing), but not both at the same time. It also does not provide receipt-freeness, thus enabling vote buying by letting the voters contstruct receipts proving how they voted. Recently, an extension to Helios, further referred to as KTV-Helios, has been proposed that claims to provide these additional security properties. However, the authors of KTV-Helios did not prove their claims. Our first contribution is to provide formal definition for participation privacy and receipt-freeness, that can be applied to KTV-Helios. These definitions were used to also prove the corresponding claims of KTV-Helios. Our second contribution is to use the existing definitions of ballot privacy and verifiability against malicious bulletin board as applied to Helios in order to prove that both security properties also hold for KTV-Helios.
منابع مشابه
Security Proofs for Participation Privacy and Verifiability for Helios
The Helios voting scheme is well studied including formal proofs for verifiability and ballot privacy, but it does not provide participation privacy (i.e. it reveals who participated in the election). Kulyk, Teague and Volkamer proposed an extension to Helios that is claimed to provide ballot privacy as well as participation privacy while providing verifiability against a malicious bulletin boa...
متن کاملSecurity Proofs for Participation Privacy and Stronger Veri ability for Helios
The Helios voting scheme is well studied including formal proofs for verifiability and ballot privacy, but it does not provide participation privacy (i.e. it reveals who participated in the election). Kulyk, Teague and Volkamer proposed an extension to Helios that is claimed to provide ballot privacy as well as participation privacy while providing stronger verifiability than Helios. However, t...
متن کاملElection Verifiability for Helios under Weaker Trust Assumptions
Most electronic voting schemes aim at providing verifiability: voters should trust the result without having to rely on some authorities. Actually, even a prominent voting system like Helios cannot fully achieve verifiability since a dishonest bulletin board may add ballots. This problem is called ballot stuffing. In this paper we give a definition of verifiability in the computational model to...
متن کاملReceipt - free Electronic Voting throughCollaboration of Voter and Honest
In this paper, we propose a new electronic voting scheme which guarantees receipt-freeness as well as privacy, universal veriiability and robustness. The result of Cramer, Gennaro, and SchoenmarkerssCGS97] proposed at Eurocrypt'97 seems to be promising because it provides optimal performance , privacy, robustness, and universal veriiability. But in their scheme, receipt-freeness was left as an ...
متن کاملAnalysis of Receipt-freeness in the Internet Voting Protocol with Applied Pi Calculus
The practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-freeness, and coercion-resistance. Privacy describes the fact that a particular vote in a particular way is not revealed to anyone. Receipt-freeness means that the voter can not produce a receipt to prove that he votes ...
متن کامل