{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T21:18:19Z","timestamp":1762377499502,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031488054"},{"type":"electronic","value":"9783031488061"}],"license":[{"start":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T00:00:00Z","timestamp":1701734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T00:00:00Z","timestamp":1701734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-48806-1_5","type":"book-chapter","created":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T17:02:12Z","timestamp":1701709332000},"page":"63-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Overstatement-Net-Equivalent Risk-Limiting Audit: ONEAudit"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3771-9604","authenticated-orcid":false,"given":"Philip B.","family":"Stark","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,5]]},"reference":[{"key":"5_CR1","unstructured":"Appel, A.: Sort the mail-in ballot envelopes, or don\u2019t? (2023). https:\/\/freedom-to-tinker.com\/2023\/05\/01\/sort-the-mail-in-ballot-envelopes-or-dont\/. Accessed 16 June 2023"},{"key":"5_CR2","unstructured":"Appel, A., Stark, P.: Evidence-based elections: create a meaningful paper trail, then audit. Georgetown Law Technol. Rev. 4(2), 523\u2013541 (2020). https:\/\/georgetownlawtechreview.org\/wp-content\/uploads\/2020\/07\/4.2-p523-541-Appel-Stark.pdf"},{"key":"5_CR3","unstructured":"Ba\u00f1uelos, J., Stark, P.: Limiting risk by turning manifest phantoms into evil zombies. Technical report (2012). https:\/\/arxiv.org\/abs\/1207.3413. Accessed 17 July 2012"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-030-00419-4_2","volume-title":"Electronic Voting","author":"M Blom","year":"2018","unstructured":"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\u201334. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00419-4_2"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Harrison, A., Fuller, B., Russell, A.: Lazy risk-limiting ballot comparison audits (2022). https:\/\/doi.org\/10.48550\/arXiv.2202.02607","DOI":"10.48550\/arXiv.2202.02607"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Higgins, M., Rivest, R., Stark, P.: Sharper p-values for stratified post-election audits. Stat. Politics Policy 2(1) (2011). https:\/\/doi.org\/10.2202\/2151-7509.1031","DOI":"10.2202\/2151-7509.1031"},{"key":"5_CR7","unstructured":"Lindeman, M., McBurnett, N., Ottoboni, K., Stark, P.: Next steps for the Colorado risk-limiting audit (CORLA) program (2018). https:\/\/arxiv.org\/abs\/1803.00698"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/MSP.2012.56","volume":"10","author":"M Lindeman","year":"2012","unstructured":"Lindeman, M., Stark, P.: A gentle introduction to risk-limiting audits. IEEE Secur. Priv. 10, 42\u201349 (2012)","journal-title":"IEEE Secur. Priv."},{"key":"5_CR9","unstructured":"Lindeman, M., Stark, P., Yates, V.: BRAVO: ballot-polling risk-limiting audits to verify outcomes. In: Proceedings of the 2011 Electronic Voting Technology Workshop\/Workshop on Trustworthy Elections (EVT\/WOTE 2011). USENIX (2012)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-030-00419-4_12","volume-title":"Electronic Voting","author":"K Ottoboni","year":"2018","unstructured":"Ottoboni, K., Stark, P.B., Lindeman, M., McBurnett, N.: Risk-limiting audits by stratified union-intersection tests of elections (SUITE). In: Krimmer, R., et al. (eds.) E-Vote-ID 2018. LNCS, vol. 11143, pp. 174\u2013188. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00419-4_12"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-030-43725-1_16","volume-title":"Financial Cryptography and Data Security","author":"K Ottoboni","year":"2020","unstructured":"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\u00f8nne, P.B., Sala, M. (eds.) FC 2019. LNCS, vol. 11599, pp. 226\u2013241. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43725-1_16"},{"key":"5_CR12","unstructured":"Rhode Island RLA Working Group: Pilot implementation study of risk-limiting audit methods in the state of Rhode Island (2019). https:\/\/www.brennancenter.org\/sites\/default\/files\/2019-09\/Report-RI-Design-FINAL-WEB4.pdf"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-031-15911-4_7","volume-title":"Electronic Voting","author":"JV Spertus","year":"2022","unstructured":"Spertus, J.V., Stark, P.B.: Sweeter than SUITE: supermartingale stratified union-intersection tests of elections. In: Krimmer, R., Volkamer, M., Duenas-Cid, D., Ronne, P., Germann, M. (eds.) E-Vote-ID 2022. LNCS, vol. 13553, pp. 106\u2013121. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15911-4_7"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-030-43725-1_17","volume-title":"Financial Cryptography and Data Security","author":"M Sridhar","year":"2020","unstructured":"Sridhar, M., Rivest, R.L.: k-cut: a simple approximately-uniform method for sampling ballots in post-election audits. In: Bracciali, A., Clark, J., Pintore, F., R\u00f8nne, P.B., Sala, M. (eds.) FC 2019. LNCS, vol. 11599, pp. 242\u2013256. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43725-1_17"},{"key":"5_CR15","unstructured":"Stark, P.: Election audits by sampling with probability proportional to an error bound: dealing with discrepancies (2008). https:\/\/statistics.berkeley.edu\/~stark\/Preprints\/ppebwrwd08.pdf"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Stark, P.: A sharper discrepancy measure for post-election audits. Ann. Appl. Stat. 2, 982\u2013985 (2008). https:\/\/arxiv.org\/abs\/0811.1697","DOI":"10.1214\/08-AOAS171"},{"key":"5_CR17","unstructured":"Stark, P.: Super-simple simultaneous single-ballot risk-limiting audits. In: Proceedings of the 2010 Electronic Voting Technology Workshop \/ Workshop on Trustworthy Elections (EVT\/WOTE 2010). USENIX (2010). https:\/\/www.usenix.org\/events\/evtwote10\/tech\/full_papers\/Stark.pdf"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-030-54455-3_23","volume-title":"Financial Cryptography and Data Security","author":"PB Stark","year":"2020","unstructured":"Stark, P.B.: Sets of half-average nulls generate risk-limiting audits: SHANGRLA. In: Bernhard, M., et al. (eds.) FC 2020. LNCS, vol. 12063, pp. 319\u2013336. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54455-3_23"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-031-25460-4_31","volume-title":"Computer Security","author":"P Stark","year":"2023","unstructured":"Stark, P.: Non(c)esuch ballot-level risk-limiting audits for precinct-count voting systems. In: Katsikas, S., et al. (eds.) ESORICS 2022. LNCS, vol. 13785, pp. 541\u2013554. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-25460-4_31"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Stark, P.B.: Conservative statistical post-election audits. Ann. Appl. Stat. 2, 550\u2013581 (2008). https:\/\/arxiv.org\/abs\/0807.4005","DOI":"10.1214\/08-AOAS161"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1109\/TIFS.2009.2034190","volume":"4","author":"PB Stark","year":"2009","unstructured":"Stark, P.B.: Risk-limiting post-election audits: $$P$$-values from common probability inequalities. IEEE Trans. Inf. Forensics Secur. 4, 1005\u20131014 (2009)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1214\/22-AOAS1646","volume":"17","author":"PB Stark","year":"2023","unstructured":"Stark, P.B.: ALPHA: audit that learns from previously hand-audited ballots. Ann. Appl. Stat. 17, 641\u2013679 (2023). https:\/\/doi.org\/10.1214\/22-AOAS1646","journal-title":"Ann. Appl. Stat."}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security. FC 2023 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48806-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T17:02:49Z","timestamp":1701709369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48806-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,5]]},"ISBN":["9783031488054","9783031488061"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48806-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,5]]},"assertion":[{"value":"5 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bol, Bra\u010d","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc23.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"182","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full papers have been accepted from 18 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}