Vote-Independence: A Powerful Privacy Notion for Voting Protocols

@inproceedings{Dreier2011VoteIndependenceAP,
  title={Vote-Independence: A Powerful Privacy Notion for Voting Protocols},
  author={Jannik Dreier and Pascal Lafourcade and Yassine Lakhnech},
  booktitle={FPS},
  year={2011}
}
Recently an attack on ballot privacy in Helios has been discovered [20], which is essentially based on copying other voter's votes. To capture this and similar attacks, we extend the classical threat model and introduce a new security notion for voting protocols: Vote-Independence. We give a formal definition and analyze its relationship to established privacy properties such as Vote-Privacy, Receipt-Freeness and Coercion-Resistance. In particular we show that even Coercion-Resistant protocols… 
Defining Privacy for Weighted Votes, Single and Multi-voter Coercion
TLDR
A definition for privacy in voting protocols in the Applied π-Calculus is presented and it is proved that under certain realistic assumptions a protocol secure against coercion of a single voter is also secureagainst coercion of multiple voters.
A formal taxonomy of privacy in voting protocols
TLDR
A family of symbolic privacy notions that allows to assess the level of privacy ensured by a voting protocol is proposed that is applicable to protocols featuring multiple votes per voter and special attack scenarios such as vote-copying or forced abstention.
Formal Verification of Voting and Auction Protocols : From Privacy to Fairness and Verifiability
TLDR
This document formally analyze security in electronic voting and electronic auctions, and proposes a hierarchy of privacy notions in the Applied Pi-Calculus, including different levels of coercion, special attacks such as forced-abstention attacks, and inside attackers.
Enforcing Privacy in the Presence of Others: Notions, Formalisations and Relations
TLDR
Independence of privacy is proposed to capture the negative privacy impact that third parties can have, and coalition privacy to capture their positive privacy impact, formally defined in the applied pi calculus and built a hierarchy showing their relations.
Attacking and Fixing Helios: An Analysis of Ballot Secrecy
  • V. Cortier, B. Smyth
  • Computer Science, Mathematics
    2011 IEEE 24th Computer Security Foundations Symposium
  • 2011
TLDR
This paper analyzes ballot secrecy and discovers a vulnerability which allows an adversary to compromise the privacy of voters and presents a fix, which satisfies a formal definition of ballot secrecy using the applied pi calculus.
Attacking and fixing Helios: An analysis of ballot secrecy
TLDR
A vulnerability is discovered which allows an adversary to compromise the privacy of voters in Helios and it is argued that independence and privacy properties are unrelated, and non-malleability is stronger than independence.
Using mobile device communication to strengthen e-Voting protocols
TLDR
This paper shows how the additional communication capabilities given by the pervasive availability of mobile phones today can be used to strengthen the security offered by remote e-voting protocols.
Verify-Your-Vote: A Verifiable Blockchain-Based Online Voting Protocol
TLDR
This paper designs a fully verifiable online electronic voting protocol, called VYV for Verify-Your-Vote, which ensures the following privacy and security properties: only eligible voter can vote, authentication of the voter, vote privacy, receipt-freeness, fairness, individual and universal verifiability.
Formal Verification of e-Auction Protocols
TLDR
This work proposes a formal framework to analyze and verify security properties of e-Auction protocols, model protocols in the Applied π-Calculus and define privacy notions, which include secrecy of bids, anonymity of the participants, receipt-freeness and coercion-resistance.
...
1
2
...

References

SHOWING 1-10 OF 33 REFERENCES
Coercion-resistant electronic elections
TLDR
A model for electronic election schemes that involves a more powerful adversary than previous work that allows the adversary to demand of coerced voters that they vote in a particular manner, abstain from voting, or even disclose their secret keys.
Verifying privacy-type properties of electronic voting protocols
TLDR
A model and definitions allow us to specify and easily change which authorities are supposed to be trustworthy in electronic voting protocols, and it is shown in accordance with intuition that coercion-resistance implies receipt-freeness, which implies vote-privacy.
Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
TLDR
This paper reports on some of the recent efforts in using the applied pi calculus to model and analyse properties of electronic elections, particularly vote-privacy and receipt-freeness, and expresses these properties using observational equivalence.
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first receipt-free
Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator
TLDR
A new verifiable and coercion-free voting scheme Bingo Voting is presented, which is based on a trusted random number generator, which shows the practicality of the scheme: all costly computations can be moved to a non time critical pre-voting phase.
Towards Trustworthy Elections, New Directions in Electronic Voting
TLDR
The Witness-Voting System, a Secure Architecture for Voting Electronically (SAVE), and Anonymous One-Time Broadcast Using Non-interactive Dining Cryptographer Nets with Applications to Voting are presented.
An electronic voting scheme
  • T. Okamoto
  • Business
    IFIP World Conference on IT Tools
  • 1996
TLDR
A practical large scaled secret voting scheme which satisfies the receipt-free property* as well as the fairness property† is proposed, which is based on a non-anonymous channel, a bulletin board, and a private channel.
Attacking and Fixing Helios: An Analysis of Ballot Secrecy
  • V. Cortier, B. Smyth
  • Computer Science, Mathematics
    2011 IEEE 24th Computer Security Foundations Symposium
  • 2011
TLDR
This paper analyzes ballot secrecy and discovers a vulnerability which allows an adversary to compromise the privacy of voters and presents a fix, which satisfies a formal definition of ballot secrecy using the applied pi calculus.
A Practical Secret Voting Scheme for Large Scale Elections
TLDR
This paper proposes a practical secret voting scheme for large scale elections that ensures the privacy of the voters even if both the administrator and the counter conspire, and realizes voting fairness, i.e., no one can know even intermediate result of the voting.
Election Verifiability in Electronic Voting Protocols
TLDR
A formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus is presented, given in terms of boolean tests which can be performed on the data produced by an election.
...
1
2
3
4
...