16 citations · 49 across the 13 of their papers we have counts for
15 papers
Assertion-Based Approaches to Auditing Complex Elections, with Application to Party-List Proportional Elections
Michelle Blom, Jurlind Budurushi, Ronald L. Rivest +4
Risk-limiting audits (RLAs), an ingredient in evidence-based elections, are increasingly common. They are a rigorous statistical means of ensuring that electoral results are correc…
A Unified Evaluation of Two-Candidate Ballot-Polling Election Auditing Methods
Zhuoqun Huang, Ronald L. Rivest, Philip B. Stark +2
Counting votes is complex and error-prone. Several statistical methods have been developed to assess election accuracy by manually inspecting randomly selected physical ballots. Tw…
-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-Election Audits
Mayuri Sridhar, Ronald L. Rivest
We present an approximate sampling framework and discuss how risk-limiting audits can compensate for these approximations, while maintaining their "risk-limiting" properties. Our f…
Bernoulli Ballot Polling: A Manifest Improvement for Risk-Limiting Audits
Kellie Ottoboni, Matthew Bernhard, J. Alex Halderman +2
We present a method and software for ballot-polling risk-limiting audits (RLAs) based on Bernoulli sampling: ballots are included in the sample with probability , independently.…
Consistent Sampling with Replacement
Ronald L. Rivest
We describe a very simple method for `consistent sampling' that allows for sampling with replacement. The method extends previous approaches to consistent sampling, which assign a…
Bayesian Tabulation Audits: Explained and Extended
Ronald L. Rivest
Tabulation audits for an election provide statistical evidence that a reported contest outcome is "correct" (meaning that the tabulation of votes was properly performed), or else t…
Public Evidence from Secret Ballots
Matthew Bernhard, Josh Benaloh, J. Alex Halderman +6
Elections seem simple---aren't they just counting? But they have a unique, challenging combination of security and privacy requirements. The stakes are high; the context is adversa…
ClipAudit: A Simple Risk-Limiting Post-Election Audit
Ronald L. Rivest
We propose a simple risk-limiting audit for elections, ClipAudit. To determine whether candidate A (the reported winner) actually beat candidate B in a plurality election, ClipAudi…
Optimality of Correlated Sampling Strategies
Mohammad Bavarian, Badih Ghazi, Elad Haramaty +3
In the "correlated sampling" problem, two players are given probability distributions and , respectively, over the same finite set, with access to shared randomness. Without…
Auditing Australian Senate Ballots
Berj Chilingirian, Zara Perumal, Ronald L. Rivest +6
We explain why the Australian Electoral Commission should perform an audit of the paper Senate ballots against the published preference data files. We suggest four different post-e…
An IBE-based Signcryption Scheme for Group Key Management
Peter Gutmann, Steven M. Bellovin, Matt Blaze +2
This paper presents a new crypto scheme whose title promises it to be so boring that no-one will bother reading past the abstract. Because of this, the remainder of the paper is le…
DiffSum - A Simple Post-Election Risk-Limiting Audit
Ronald L. Rivest
This paper presents DiffSum, a simple post-election risk-limiting ballot-polling audit for two-candidate plurality elections. DiffSum sequentially draws ballots (without replacemen…
End-to-end verifiability
Josh Benaloh, Ronald Rivest, Peter Y. A. Ryan +3
This pamphlet describes end-to-end election verifiability (E2E-V) for a nontechnical audience: election officials, public policymakers, and anyone else interested in secure, transp…
Leading the field: Fortune favors the bold in Thurstonian choice models
Steven N. Evans, Ronald L. Rivest, Philip B. Stark
Schools with the highest average student performance are often the smallest schools; localities with the highest rates of some cancers are frequently small and the effects observed…
Picture-Hanging Puzzles
Erik D. Demaine, Martin L. Demaine, Yair N. Minsky +3
We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and…