Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Simulations of Ballot Polling Risk-Limiting Audits

  • Conference paper
  • First Online:
Financial Cryptography and Data Security. FC 2022 International Workshops (FC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13412))

Included in the following conference series:

  • 555 Accesses

Abstract

In this paper we present simulation results comparing the risk, stopping probability, and number of ballots required over multiple rounds of ballot polling risk-limiting audits (RLAs) Minerva, Selection-Ordered (SO) Bravo, and End-of-Round (EoR) Bravo . Bravo is the most commonly used ballot polling RLA and requires the smallest expected number of ballots when ballots are drawn one at a time and the (true) underlying election is as announced. In real audits, multiple ballots are drawn at a time, and Bravo is implemented as SO Bravo or EoR Bravo . Minerva is a recently proposed ballot polling RLA that requires fewer ballots than either implementation of Bravo in a first round with stopping probability 0.9 but requires a predetermined round schedule. It is an open question how these audits compare over multiple rounds and for lower stopping probabilities. Our simulations use stopping probabilities of 0.9 and 0.25. The results are consistent with predictions of the R2B2 open-source library for ballot polling audits. We observe that both Bravo audits are more conservative than Minerva, which stops with fewer ballots, for both first round stopping probabilities. However, the advantage of using Minerva decreases considerably for the smaller first round stopping probability, as one would expect.

O. Broadrick, S. Morin, G. McClearn and P. L. Vora—Supported in part by NSF Award 2015253.

F. Zagórski—Author was partially supported by Polish National Science Centre contract number DEC-2013/09/D/ST6/03927.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Their proof assumes that the number of relevant ballots drawn in each round is know beforehand. In MINERVA, the number of ballots drawn in each round is determined before any ballots are drawn. Because invalid ballots and ballots that are inconsequential for the contest being audited would be drawn in addition to relevant ballots, the assumption used by the proof is not true in general. (We are grateful to Philip Stark for drawing our attention to this.) However, any variation in number of relevant ballots drawn for a fixed round size would be random and not chosen by an adversary; the proof showing the risk-limiting property of MINERVA could hence be extended.

  2. 2.

    or the announced winner lost by one vote, and the number of ballots is large enough that the probability of drawing a ballot for the winner is that of drawing one for the loser.

References

  1. Bernhard, M.: Election Security Is Harder Than You Think. Ph.D. thesis, University of Michigan (2020)

    Google Scholar 

  2. Blom, M., Stuckey, P.J., Teague, V.J.: Ballot-polling risk limiting audits for IRV elections. In: Krimmer, R., et al. (eds.) E-Vote-ID 2018. LNCS, vol. 11143, pp. 17–34. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00419-4_2

    Chapter  Google Scholar 

  3. Cause, C., VerifiedVoting, Center, B.: Pilot implementation study of risk-limiting audit methods in the state of Rhode Island. https://www.brennancenter.org/sites/default/files/2019-09/Report-RI-Design-FINAL-WEB4.pdf

  4. Huang, Z., Rivest, R.L., Stark, P.B., Teague, V.J., Vukcevic, D.: A unified evaluation of two-candidate ballot-polling election auditing methods. In: Krimmer, R., et al. (eds.) E-Vote-ID 2020. LNCS, vol. 12455, pp. 112–128. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-60347-2_8

    Chapter  Google Scholar 

  5. Lindeman, M., Stark, P.B.: A gentle introduction to risk-limiting audits. IEEE Secur. Priv. 10(5), 42–49 (2012)

    Article  Google Scholar 

  6. Lindeman, M., Stark, P.B., Yates, V.S.: BRAVO: ballot-polling risk-limiting audits to verify outcomes. In: EVT/WOTE (2012)

    Google Scholar 

  7. McLaughlin, K., Stark, P.B.: Simulations of risk-limiting audit techniques and the effects of reducing batch size on the 2008 California House of Representatives elections (2010). https://www.stat.berkeley.edu/users/vigre/undergrad/reports/McLaughlin_Stark.pdf

  8. McLaughlin, K., Stark, P.B.: Workload estimates for risk-limiting audits of large contests (2011). https://www.stat.berkeley.edu/stark/Preprints/workload11.pdf

  9. Morin, S., McClearn, G.: The R2B2 (Round-by-Round, Ballot-by-Ballot) library. https://github.com/gwexploratoryaudits/r2b2

  10. Ottoboni, K., Bernhard, M., Halderman, J.A., Rivest, R.L., Stark, P.B.: Bernoulli ballot polling: a manifest improvement for risk-limiting audits. In: Bracciali, A., Clark, J., Pintore, F., Rønne, P.B., Sala, M. (eds.) FC 2019. LNCS, vol. 11599, pp. 226–241. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-43725-1_16

    Chapter  Google Scholar 

  11. Rivest, R.L., Shen, E.: A Bayesian method for auditing elections. In: EVT/WOTE (2012)

    Google Scholar 

  12. Stark, P.B.: Simulating a ballot-polling audit with cards and dice. In: Multidisciplinary Conference on Election Auditing, MIT (2018). http://electionlab.mit.edu/sites/default/files/2018-12/eas-ballotpollingsimulation.pdf

  13. Stark, P.B., Wagner, D.A.: Evidence-based elections. IEEE Secur. Priv. 10(5), 33–41 (2012). https://doi.org/10.1109/MSP.2012.62

    Article  Google Scholar 

  14. Virginia Department of Elections: Results of risk-limiting audit of 3 November 2020 general election in Virginia. https://www.elections.virginia.gov/rla-results_nov-3-2020/

  15. Vora, P.L.: Risk-limiting Bayesian polling audits for two candidate elections. CoRR abs/1902.00999 (2019). http://arxiv.org/abs/1902.00999

  16. VotingWorks: Arlo. https://voting.works/risk-limiting-audits/

  17. Wald, A.: Sequential tests of statistical hypotheses. Ann. Math. Stat. 16(2), 117–186 (1945)

    Article  MathSciNet  MATH  Google Scholar 

  18. Zagórski, F., McClearn, G., Morin, S., McBurnett, N., Vora, P.L.: The Athena class of risk-limiting ballot polling audits. CoRR abs/2008.02315 (2020). https://arxiv.org/abs/2008.02315

  19. Zagórski, F., McClearn, G., Morin, S., McBurnett, N., Vora, P.L.: Minerva– an efficient risk-limiting ballot polling audit. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 3059–3076. USENIX Association (2021). https://www.usenix.org/conference/usenixsecurity21/presentation/zagorski

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Filip Zagórski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 International Financial Cryptography Association

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Broadrick, O., Morin, S., McClearn, G., McBurnett, N., Vora, P.L., Zagórski, F. (2023). Simulations of Ballot Polling Risk-Limiting Audits. In: Matsuo, S., et al. Financial Cryptography and Data Security. FC 2022 International Workshops. FC 2022. Lecture Notes in Computer Science, vol 13412. Springer, Cham. https://doi.org/10.1007/978-3-031-32415-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-32415-4_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-32414-7

  • Online ISBN: 978-3-031-32415-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics