Risk-Limiting Tallies

@article{Jamroga2019RiskLimitingT,
  title={Risk-Limiting Tallies},
  author={W. Jamroga and Peter B. R{\o}nne and P. Ryan and P. Stark},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.04947}
}
Many voter-verifiable, coercion-resistant schemes have been proposed, but even the most carefully designed systems necessarily leak information via the announced result. In corner cases, this may be problematic. For example, if all the votes go to one candidate then all vote privacy evaporates. The mere possibility of candidates getting no or few votes could have implications for security in practice: if a coercer demands that a voter cast a vote for such an unpopular candidate, then the voter… Expand
Electronic Voting: 5th International Joint Conference, E-Vote-ID 2020, Bregenz, Austria, October 6–9, 2020, Proceedings
TLDR
This paper construct manipulations of the ballots in order to change the overall balance of power in an Australian Federal Senate election – the upper house of Parliament. Expand
Representative Committees of Peers
TLDR
It is demonstrated that the k-sortition is the worst-case optimal rule within a broad family of committee-based rules that take into account metric information about the preference profile of the whole population. Expand
RiLACS: Risk-Limiting Audits via Confidence Sequences
Accurately determining the outcome of an election is a complex task with many potential sources of error, ranging from software glitches in voting machines to procedural lapses to outright fraud.Expand

References

SHOWING 1-10 OF 30 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. Expand
Receipt-free secret-ballot elections (extended abstract)
TLDR
This paper presents the first verifiable secret-ballot election protocols in which participants are unable to prove to others how they voted, and describes how this defect is embedded within prior election protocols. Expand
Selene: Voting with Transparent Verifiability and Coercion-Mitigation
TLDR
This paper takes a different approach and revisit an old idea: to provide each voter with a private tracking number, to ensure that no two voters are assigned the same tracker and to keep the link between voters and trackers private. Expand
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. Expand
Coercion-Resistant Tallying for STV Voting
TLDR
This paper solves the problem for the popular STV system, by constructing an algorithm for the verifiable tallying of encrypted votes and improves upon existing work because it extends to multiple-seat STV and reveals less information than other schemes. Expand
Alethea: A Provably Secure Random Sample Voting Protocol
TLDR
This work proposes Alethea, the first random sample voting protocol that satisfies end-to-end verifiability and receipt-freeness and defines new security properties related to the randomness and anonymity of the sample group and the probability of undetected manipulations. Expand
New Techniques for Electronic Voting
This paper presents a novel unifying framework for electronic voting in the universal composability model that includes a property which is new to universal composability but well-known to votingExpand
Pretty Good Democracy
  • P. Ryan
  • Computer Science
  • Security Protocols Workshop
  • 2009
TLDR
A simple technique to enhance the verifiability of code voting by ensuring that the Vote Server can only access the acknowledgement codes if the vote code is correctly registered by a threshold set of Trustees. Expand
A Game-Based Definition of Coercion-Resistance and Its Applications
TLDR
This paper presents a simple and intuitive, yet widely applicable cryptographic definition of coercionresistance, in the style of game-based definitions, that allows to precisely measure the level of coercion-resistance a protocol provides. Expand
A Game-Based Definition of Coercion-Resistance and Its Applications
TLDR
This paper presents a simple and intuitive, yet widely applicable cryptographic definition of coercionresistance, in the style of game-based definitions, that allows to precisely measure the level of coercion-resistance a protocol provides. Expand
...
1
2
3
...