{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T23:59:19Z","timestamp":1781308759398,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":86,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DFG","award":["KU 1434\/11-1"],"award-info":[{"award-number":["KU 1434\/11-1"]}]},{"name":"French ANR","award":["ANR-20-CYAL-0006"],"award-info":[{"award-number":["ANR-20-CYAL-0006"]}]},{"name":"German BMBF","award":["16KIS1441"],"award-info":[{"award-number":["16KIS1441"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560701","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"1443-1457","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Kryvos"],"prefix":"10.1145","author":[{"given":"Nicolas","family":"Huber","sequence":"first","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ralf","family":"K\u00fcsters","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Toomas","family":"Krips","sequence":"additional","affiliation":[{"name":"University of Tartu, Tartu, Estonia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julian","family":"Liedtke","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"M\u00fcller","sequence":"additional","affiliation":[{"name":"University of Luxembourg, Luxembourg, Luxembourg"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Rausch","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pascal","family":"Reisert","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Vogt","sequence":"additional","affiliation":[{"name":"University of Applied Sciences and Arts Northwestern Switzerland, Windisch, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"ACM. 2020. Q&A on ACM's Internet Voting. https:\/\/www.acm.org\/binaries\/content\/assets\/acmelections\/acminternetvoting-1.pdf.  ACM. 2020. Q&A on ACM's Internet Voting. https:\/\/www.acm.org\/binaries\/content\/assets\/acmelections\/acminternetvoting-1.pdf."},{"key":"e_1_3_2_2_2_1","first-page":"335","article-title":"Helios","volume":"2008","author":"Adida B.","year":"2008","unstructured":"B. Adida . 2008 . Helios : Web-based Open-Audit Voting. In USENIX 2008. 335 -- 348 . B. Adida. 2008. Helios: Web-based Open-Audit Voting. In USENIX 2008. 335--348.","journal-title":"Web-based Open-Audit Voting. In USENIX"},{"key":"e_1_3_2_2_3_1","volume-title":"USENIX\/ACCURATE Electronic Voting Technology (EVT","author":"Adida Ben","year":"2009","unstructured":"Ben Adida , Olivier de Marneffe , Olivier Pereira , and Jean-Jaques Quisquater . 2009. Electing a University President Using Open-Audit Voting: Analysis of Real-World Use of Helios . In USENIX\/ACCURATE Electronic Voting Technology (EVT 2009 ). Ben Adida, Olivier de Marneffe, Olivier Pereira, and Jean-Jaques Quisquater. 2009. Electing a University President Using Open-Audit Voting: Analysis of Real-World Use of Helios. In USENIX\/ACCURATE Electronic Voting Technology (EVT 2009)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_2_5_1","volume-title":"Ivan Bjerre Damg\u00e5rd, and Daniel Escudero","author":"Attema Thomas","year":"2022","unstructured":"Thomas Attema , Ignacio Cascudo , Ronald Cramer , Ivan Bjerre Damg\u00e5rd, and Daniel Escudero . 2022 . Vector Commitments over Rings and Compressed \u03a3 $-Protocols. Cryptology ePrint Archive ( 2022). Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Bjerre Damg\u00e5rd, and Daniel Escudero. 2022. Vector Commitments over Rings and Compressed \u03a3 $-Protocols. Cryptology ePrint Archive (2022)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0702634104"},{"key":"e_1_3_2_2_7_1","volume-title":"Judge: Don't Vote! Operations Research","author":"Balinski Michel","year":"2014","unstructured":"Michel Balinski and Rida Laraki . 2014 . Judge: Don't Vote! Operations Research , Vol. 62 , 3 (2014), 483--511. Michel Balinski and Rida Laraki. 2014. Judge: Don't Vote! Operations Research, Vol. 62, 3 (2014), 483--511."},{"key":"e_1_3_2_2_8_1","volume-title":"USENIX Journal of Election Technology and Systems (JETS)","volume":"1","author":"Bell Susan","year":"2013","unstructured":"Susan Bell , Josh Benaloh , Mike Byrne , Dana DeBeauvoir , Bryce Eakin , Gail Fischer , Philip Kortum , Neal McBurnett , Julian Montoya , Michelle Parker , Olivier Pereira , Philip Stark , Dan Wallach , and Michael Winn . 2013 . STAR-Vote: A Secure, Transparent, Auditable, and Reliable Voting System . USENIX Journal of Election Technology and Systems (JETS) , Vol. 1 (August 2013), 18--37. Susan Bell, Josh Benaloh, Mike Byrne, Dana DeBeauvoir, Bryce Eakin, Gail Fischer, Philip Kortum, Neal McBurnett, Julian Montoya, Michelle Parker, Olivier Pereira, Philip Stark, Dan Wallach, and Michael Winn. 2013. STAR-Vote: A Secure, Transparent, Auditable, and Reliable Voting System. USENIX Journal of Election Technology and Systems (JETS) , Vol. 1 (August 2013), 18--37."},{"key":"e_1_3_2_2_9_1","first-page":"46","article-title":"Scalable, Transparent, and Post-Quantum Secure Computational Integrity","volume":"2018","author":"Ben-Sasson Eli","year":"2018","unstructured":"Eli Ben-Sasson , Iddo Bentov , Yinon Horesh , and Michael Riabzev . 2018 . Scalable, Transparent, and Post-Quantum Secure Computational Integrity . IACR Cryptology ePrint Archive , Vol. 2018 (2018), 46 . Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2018. Scalable, Transparent, and Post-Quantum Secure Computational Integrity. IACR Cryptology ePrint Archive , Vol. 2018 (2018), 46.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_10_1","volume-title":"Ward","author":"Ben-Sasson Eli","year":"2019","unstructured":"Eli Ben-Sasson , Alessandro Chiesa , Michael Riabzev , Nicholas Spooner , Madars Virza , and Nicholas P . Ward . 2019 . Aurora : Transparent Succinct Arguments for R1CS. In Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19--23, 2019, Proceedings, Part I (Lecture Notes in Computer Science , Vol. 11476). Springer, 103-- 128 . Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P. Ward. 2019. Aurora: Transparent Succinct Arguments for R1CS. In Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19--23, 2019, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 11476). Springer, 103--128."},{"key":"e_1_3_2_2_11_1","volume-title":"Verifiable Secret Ballot Elections. Ph.,D. Dissertation","author":"Benaloh J.G.","unstructured":"J.G. Benaloh . 1987. Verifiable Secret Ballot Elections. Ph.,D. Dissertation . Yale University . J.G. Benaloh. 1987. Verifiable Secret Ballot Elections. Ph.,D. Dissertation. Yale University."},{"key":"e_1_3_2_2_12_1","volume-title":"2007 USENIX\/ACCURATE Electronic Voting Technology Workshop, EVT'07","author":"Benaloh Josh","year":"2007","unstructured":"Josh Benaloh . 2007 . Ballot Casting Assurance via Voter-Initiated Poll Station Auditing . In 2007 USENIX\/ACCURATE Electronic Voting Technology Workshop, EVT'07 , Boston, MA, USA , August 6, 2007. Josh Benaloh. 2007. Ballot Casting Assurance via Voter-Initiated Poll Station Auditing. In 2007 USENIX\/ACCURATE Electronic Voting Technology Workshop, EVT'07, Boston, MA, USA, August 6, 2007."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2009.2033757"},{"key":"e_1_3_2_2_15_1","first-page":"499","article-title":"SoK","volume":"2015","author":"Bernhard D.","year":"2015","unstructured":"D. Bernhard , V. Cortier , D. Galindo , O. Pereira , and B. Warinschi . 2015 . SoK : A Comprehensive Analysis of Game-Based Ballot Privacy Definitions. In IEEE S&P 2015. 499 -- 516 . D. Bernhard, V. Cortier, D. Galindo, O. Pereira, and B. Warinschi. 2015. SoK: A Comprehensive Analysis of Game-Based Ballot Privacy Definitions. In IEEE S&P 2015. 499--516.","journal-title":"A Comprehensive Analysis of Game-Based Ballot Privacy Definitions. In IEEE S&P"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-76581-5_19"},{"key":"e_1_3_2_2_17_1","volume-title":"ESORICS","author":"Boyen Xavier","year":"2020","unstructured":"Xavier Boyen , Thomas Haines , and Johannes M\u00fcller . 2020 . A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing. In Computer Security - 25th European Symposium on Research in Computer Security , ESORICS 2020. Xavier Boyen, Thomas Haines, and Johannes M\u00fcller. 2020. A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing. In Computer Security - 25th European Symposium on Research in Computer Security, ESORICS 2020."},{"key":"e_1_3_2_2_18_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy, SP 2018, Proceedings, 21--23","author":"Benedikt B\u00fc","year":"2018","unstructured":"Benedikt B\u00fc nz, Jonathan Bootle , Dan Boneh , Andrew Poelstra , Pieter Wuille , and Gregory Maxwell . 2018 . Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy, SP 2018, Proceedings, 21--23 May 2018, San Francisco, California, USA. IEEE Computer Society, 315--334. Benedikt B\u00fc nz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Gregory Maxwell. 2018. Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy, SP 2018, Proceedings, 21--23 May 2018, San Francisco, California, USA. IEEE Computer Society, 315--334."},{"key":"e_1_3_2_2_19_1","volume-title":"Practical Verifiable Encryption and Decryption of Discrete Logarithms. In CRYPTO 2003, Proceedings (LNCS","volume":"144","author":"Camenisch Jan","year":"2003","unstructured":"Jan Camenisch and Victor Shoup . 2003 . Practical Verifiable Encryption and Decryption of Discrete Logarithms. In CRYPTO 2003, Proceedings (LNCS , Vol. 2729). Springer, 126-- 144 . Jan Camenisch and Victor Shoup. 2003. Practical Verifiable Encryption and Decryption of Discrete Logarithms. In CRYPTO 2003, Proceedings (LNCS, Vol. 2729). Springer, 126--144."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339820"},{"key":"e_1_3_2_2_21_1","volume-title":"Practical Strategy-Resistant Privacy-Preserving Elections. In ESORICS","author":"Canard S\u00e9","year":"2018","unstructured":"S\u00e9 bastien Canard , David Pointcheval , Quentin Santos , and Jacques Traor\u00e9 . 2018 . Practical Strategy-Resistant Privacy-Preserving Elections. In ESORICS 2019. 331--349. S\u00e9 bastien Canard, David Pointcheval, Quentin Santos, and Jacques Traor\u00e9. 2018. Practical Strategy-Resistant Privacy-Preserving Elections. In ESORICS 2019. 331--349."},{"key":"e_1_3_2_2_22_1","volume-title":"Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes. In USENIX\/ACCURATE Electronic Voting Technology (EVT","author":"Chaum D.","year":"2008","unstructured":"D. Chaum , R. Carback , J. Clark , A. Essex , S. Popoveniuc , R. L. Rivest , P. Y. A. Ryan , E. Shen , and A. T. Sherman . 2008 . Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes. In USENIX\/ACCURATE Electronic Voting Technology (EVT 2008). USENIX Association . D. Chaum, R. Carback, J. Clark, A. Essex, S. Popoveniuc, R. L. Rivest, P. Y. A. Ryan, E. Shen, and A. T. Sherman. 2008. Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes. In USENIX\/ACCURATE Electronic Voting Technology (EVT 2008). USENIX Association."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"e_1_3_2_2_24_1","volume-title":"Civitas: Toward a Secure Voting System. In S&P","author":"Clarkson M. R.","year":"2008","unstructured":"M. R. Clarkson , S. Chong , and A. C. Myers . 2008 . Civitas: Toward a Secure Voting System. In S&P 2008. 354--368. M. R. Clarkson, S. Chong, and A. C. Myers. 2008. Civitas: Toward a Secure Voting System. In S&P 2008. 354--368."},{"key":"e_1_3_2_2_25_1","volume-title":"Myers","author":"Clarkson Michael R.","year":"2005","unstructured":"Michael R. Clarkson and Andrew C . Myers . 2005 . Coercion-Resistant Remote Voting Using Decryption Mixes. In In Frontiers in Electronic Elections (FEE 2005). Michael R. Clarkson and Andrew C. Myers. 2005. Coercion-Resistant Remote Voting Using Decryption Mixes. In In Frontiers in Electronic Elections (FEE 2005)."},{"key":"e_1_3_2_2_26_1","volume-title":"ESORICS","author":"Cortier V.","year":"2014","unstructured":"V. Cortier , D. Galindo , S. Glondu , and M. Izabach\u00e8 ne. 2014. Election Verifiability for Helios under Weaker Trust Assumptions . In ESORICS 2014 . 327--344. V. Cortier, D. Galindo, S. Glondu, and M. Izabach\u00e8 ne. 2014. Election Verifiability for Helios under Weaker Trust Assumptions. In ESORICS 2014. 327--344."},{"key":"e_1_3_2_2_27_1","first-page":"779","article-title":"SoK","volume":"2016","author":"Cortier V.","year":"2016","unstructured":"V. Cortier , D. Galindo , R. K\u00fcsters , J. M\u00fcller , and T. Truderung . 2016 . SoK : Verifiability Notions for E-Voting Protocols. In S&P 2016. 779 -- 798 . V. Cortier, D. Galindo, R. K\u00fcsters, J. M\u00fcller, and T. Truderung. 2016. SoK: Verifiability Notions for E-Voting Protocols. In S&P 2016. 779--798.","journal-title":"Verifiability Notions for E-Voting Protocols. In S&P"},{"key":"e_1_3_2_2_28_1","first-page":"491","article-title":"A toolbox for verifiable tally-hiding e-voting systems","volume":"2021","author":"Cortier V\u00e9","year":"2021","unstructured":"V\u00e9 ronique Cortier , Pierrick Gaudry , and Quentin Yang . 2021 . A toolbox for verifiable tally-hiding e-voting systems . IACR Cryptol. ePrint Arch. , Vol. 2021 (2021), 491 . V\u00e9 ronique Cortier, Pierrick Gaudry, and Quentin Yang. 2021. A toolbox for verifiable tally-hiding e-voting systems. IACR Cryptol. ePrint Arch. , Vol. 2021 (2021), 491.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/869328"},{"key":"e_1_3_2_2_30_1","volume-title":"Multi-Authority Secret-Ballot Elections with Linear Work. In EUROCRYPT","author":"Cramer Ronald","year":"1996","unstructured":"Ronald Cramer , Matthew K. Franklin , Berry Schoenmakers , and Moti Yung . 1996 . Multi-Authority Secret-Ballot Elections with Linear Work. In EUROCRYPT 1996. 72--83. Ronald Cramer, Matthew K. Franklin, Berry Schoenmakers, and Moti Yung. 1996. Multi-Authority Secret-Ballot Elections with Linear Work. In EUROCRYPT 1996. 72--83."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055717"},{"key":"e_1_3_2_2_32_1","unstructured":"CrossRef. 2019. Election process and results. https:\/\/www.crossref.org\/board-and-governance\/elections\/.  CrossRef. 2019. Election process and results. https:\/\/www.crossref.org\/board-and-governance\/elections\/."},{"key":"e_1_3_2_2_33_1","volume-title":"IEEE CSF","author":"Culnane Chris","year":"2014","unstructured":"Chris Culnane and Steve A. Schneider . 2014. A Peered Bulletin Board for Robust Use in Verifiable Voting Systems . In IEEE CSF 2014 . 169--183. Chris Culnane and Steve A. Schneider. 2014. A Peered Bulletin Board for Robust Use in Verifiable Voting Systems. In IEEE CSF 2014. 169--183."},{"key":"e_1_3_2_2_34_1","unstructured":"Debian Project. 2012. Ubuntu IRC Council Position. https:\/\/www.debian.org\/vote\/.  Debian Project. 2012. Ubuntu IRC Council Position. https:\/\/www.debian.org\/vote\/."},{"key":"e_1_3_2_2_35_1","unstructured":"Deutsche Forschungsgemeinschaft (DFG). 2019. DFG Fachkollegienwahl 2019. https:\/\/www.dfg.de\/download\/pdf\/dfg_im_profil\/gremien\/fachkollegien\/fk-wahl2019\/ fkwahl_2019_wahlergebnis_endgueltig_200218.pdf.  Deutsche Forschungsgemeinschaft (DFG). 2019. DFG Fachkollegienwahl 2019. https:\/\/www.dfg.de\/download\/pdf\/dfg_im_profil\/gremien\/fachkollegien\/fk-wahl2019\/ fkwahl_2019_wahlergebnis_endgueltig_200218.pdf."},{"key":"e_1_3_2_2_36_1","volume-title":"NSW State Electoin Results","author":"Electoral Commission NSW. 2015.","year":"2015","unstructured":"Electoral Commission NSW. 2015. NSW State Electoin Results 2015 . https:\/\/pastvtr.elections.nsw.gov.au\/SGE2015\/la-home.htm. Electoral Commission NSW. 2015. NSW State Electoin Results 2015. https:\/\/pastvtr.elections.nsw.gov.au\/SGE2015\/la-home.htm."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2015.46"},{"key":"e_1_3_2_2_38_1","unstructured":"European Broadcasting Union. 2020. Eurovision Song Contest - How it works. https:\/\/eurovision.tv\/about\/how-it-works.  European Broadcasting Union. 2020. Eurovision Song Contest - How it works. https:\/\/eurovision.tv\/about\/how-it-works."},{"key":"e_1_3_2_2_39_1","volume-title":"ZEN: Efficient Zero-Knowledge Proofs for Neural Networks. Technical Report 2021\/87. Cryptology ePrint Archive.","author":"Feng Boyuan","year":"2021","unstructured":"Boyuan Feng , Lianke Qin , Zhenfei Zhang , Yufei Ding , and Shumo Chu . 2021 . ZEN: Efficient Zero-Knowledge Proofs for Neural Networks. Technical Report 2021\/87. Cryptology ePrint Archive. Boyuan Feng, Lianke Qin, Zhenfei Zhang, Yufei Ding, and Shumo Chu. 2021. ZEN: Efficient Zero-Knowledge Proofs for Neural Networks. Technical Report 2021\/87. Cryptology ePrint Archive."},{"key":"e_1_3_2_2_40_1","first-page":"953","article-title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge","volume":"2019","author":"Gabizon Ariel","year":"2019","unstructured":"Ariel Gabizon , Zachary J. Williamson , and Oana Ciobotaru . 2019 . PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge . IACR Cryptol. ePrint Arch. , Vol. 2019 (2019), 953 . Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru. 2019. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. IACR Cryptol. ePrint Arch. , Vol. 2019 (2019), 953.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_41_1","volume-title":"Proceedings. 3--18","author":"Galindo David","year":"2015","unstructured":"David Galindo , Sandra Guasch , and Jordi Puiggali . 2015 . 2015 Neuch\u00e2 tel's Cast-as-Intended Verification Mechanism. In VoteID 2015 , Proceedings. 3--18 . David Galindo, Sandra Guasch, and Jordi Puiggali. 2015. 2015 Neuch\u00e2 tel's Cast-as-Intended Verification Mechanism. In VoteID 2015, Proceedings. 3--18."},{"key":"e_1_3_2_2_42_1","unstructured":"Gesellschaft f\u00fcr Informatik (GI). 2019. GI Wahlen. https:\/\/gi.de\/wahlen.  Gesellschaft f\u00fcr Informatik (GI). 2019. GI Wahlen. https:\/\/gi.de\/wahlen."},{"key":"e_1_3_2_2_43_1","volume-title":"ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In 25th USENIX Security Symposium","author":"Giacomelli Irene","year":"2016","unstructured":"Irene Giacomelli , Jesper Madsen , and Claudio Orlandi . 2016 . ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In 25th USENIX Security Symposium , 2016. USENIX Association, 1069--1083. Irene Giacomelli, Jesper Madsen, and Claudio Orlandi. 2016. ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In 25th USENIX Security Symposium, 2016. USENIX Association, 1069--1083."},{"key":"e_1_3_2_2_44_1","unstructured":"Government of India. 2020. Constitution of India. https:\/\/www.india.gov.in\/my-government\/constitution-india.  Government of India. 2020. Constitution of India. https:\/\/www.india.gov.in\/my-government\/constitution-india."},{"key":"e_1_3_2_2_45_1","volume-title":"On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT 2016, Proceedings, Part II (LNCS","volume":"326","author":"Groth Jens","year":"2016","unstructured":"Jens Groth . 2016 . On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT 2016, Proceedings, Part II (LNCS , Vol. 9666). Springer, 305-- 326 . Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT 2016, Proceedings, Part II (LNCS, Vol. 9666). Springer, 305--326."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00048"},{"key":"e_1_3_2_2_47_1","volume-title":"SoK: Techniques for Verifiable Mix Nets. In IEEE 33rd Computer Security Foundations Symposium, CSF","author":"Haines Thomas","year":"2020","unstructured":"Thomas Haines and Johannes M\u00fcller . 2020 . SoK: Techniques for Verifiable Mix Nets. In IEEE 33rd Computer Security Foundations Symposium, CSF , 2020. IEEE Computer Society. Thomas Haines and Johannes M\u00fcller. 2020. SoK: Techniques for Verifiable Mix Nets. In IEEE 33rd Computer Security Foundations Symposium, CSF, 2020. IEEE Computer Society."},{"key":"e_1_3_2_2_48_1","volume-title":"VSTTE 2019","author":"Haines Thomas","year":"2019","unstructured":"Thomas Haines , Dirk Pattinson , and Mukesh Tiwari . 2019 . Verifiable Homomorphic Tallying for the Schulze Vote Counting Scheme. In Verified Software. Theories, Tools, and Experiments - 11th International Conference , VSTTE 2019 , New York City, NY, USA, July 13--14 , 2019, Revised Selected Papers (Lecture Notes in Computer Science, Vol. 12031). Springer, 36--53. Thomas Haines, Dirk Pattinson, and Mukesh Tiwari. 2019. Verifiable Homomorphic Tallying for the Schulze Vote Counting Scheme. In Verified Software. Theories, Tools, and Experiments - 11th International Conference, VSTTE 2019, New York City, NY, USA, July 13--14, 2019, Revised Selected Papers (Lecture Notes in Computer Science, Vol. 12031). Springer, 36--53."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2007.22"},{"key":"e_1_3_2_2_50_1","volume-title":"Julian Liedtke, and Daniel Rausch.","author":"Hertel Fabian","year":"2021","unstructured":"Fabian Hertel , Nicolas Huber , Jonas Kittelberger , Ralf K\u00fc sters , Julian Liedtke, and Daniel Rausch. 2021 . Extending the Tally-Hiding Ordinos System: Implementations for Borda, Hare-Niemeyer, Condorcet, and Instant-Runoff Voting. Technical Report 2021\/1420. Cryptology ePrint Archive . Fabian Hertel, Nicolas Huber, Jonas Kittelberger, Ralf K\u00fc sters, Julian Liedtke, and Daniel Rausch. 2021. Extending the Tally-Hiding Ordinos System: Implementations for Borda, Hare-Niemeyer, Condorcet, and Instant-Runoff Voting. Technical Report 2021\/1420. Cryptology ePrint Archive."},{"key":"e_1_3_2_2_51_1","volume-title":"Electronic Jury Voting Protocols. In LATIN 2002, Proceedings. 415--429","author":"Hevia Alejandro","unstructured":"Alejandro Hevia and Marcos A. Kiwi . 2002 . Electronic Jury Voting Protocols. In LATIN 2002, Proceedings. 415--429 . Alejandro Hevia and Marcos A. Kiwi. 2002. Electronic Jury Voting Protocols. In LATIN 2002, Proceedings. 415--429."},{"key":"e_1_3_2_2_52_1","first-page":"109","article-title":"Fixing the Achilles Heel of E-Voting","volume":"2020","author":"Hirschi Lucca","year":"2020","unstructured":"Lucca Hirschi , Lara Schmid , and David A. Basin . 2020 . Fixing the Achilles Heel of E-Voting : The Bulletin Board. IACR Cryptol. ePrint Arch. , Vol. 2020 (2020), 109 . Lucca Hirschi, Lara Schmid, and David A. Basin. 2020. Fixing the Achilles Heel of E-Voting: The Bulletin Board. IACR Cryptol. ePrint Arch. , Vol. 2020 (2020), 109.","journal-title":"The Bulletin Board. IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Nicolas Huber Ralf K\u00fcsters Toomas Krips Julian Liedtke Johannes M\u00fcller Daniel Rausch Pascal Reisert and Andreas Vogt. 2022a. Implementation of Kryvos. https:\/\/github.com\/JulianLiedtke\/kryvos.  Nicolas Huber Ralf K\u00fcsters Toomas Krips Julian Liedtke Johannes M\u00fcller Daniel Rausch Pascal Reisert and Andreas Vogt. 2022a. Implementation of Kryvos. https:\/\/github.com\/JulianLiedtke\/kryvos.","DOI":"10.1145\/3548606.3560701"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560701"},{"key":"e_1_3_2_2_55_1","volume-title":"Stark","author":"Jamroga Wojciech","year":"2019","unstructured":"Wojciech Jamroga , Peter B. R\u00f8nne , Peter Y. A. Ryan , and Philip B . Stark . 2019 . Risk-Limiting Tallies. In E-Vote-ID 2019, Proceedings (LNCS , Vol. 11759). Springer, 183-- 199 . Wojciech Jamroga, Peter B. R\u00f8nne, Peter Y. A. Ryan, and Philip B. Stark. 2019. Risk-Limiting Tallies. In E-Vote-ID 2019, Proceedings (LNCS, Vol. 11759). Springer, 183--199."},{"key":"e_1_3_2_2_56_1","volume-title":"Proceedings of Workshop on Privacy in the Eletronic Society (WPES","author":"Juels A.","year":"2005","unstructured":"A. Juels , D. Catalano , and M. Jakobsson . 2005. Coercion-Resistant Electronic Elections . In Proceedings of Workshop on Privacy in the Eletronic Society (WPES 2005 ). ACM Press, 61--70. A. Juels, D. Catalano, and M. Jakobsson. 2005. Coercion-Resistant Electronic Elections. In Proceedings of Workshop on Privacy in the Eletronic Society (WPES 2005). ACM Press, 61--70."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSPW54576.2021.00048"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_27"},{"key":"e_1_3_2_2_59_1","volume-title":"CCS","author":"Kiayias Aggelos","year":"2015","unstructured":"Aggelos Kiayias , Thomas Zacharias , and Bingsheng Zhang . 2015 a. DEMOS-2: Scalable E2E Verifiable Elections without Random Oracles . In CCS 2015. 352--363. Aggelos Kiayias, Thomas Zacharias, and Bingsheng Zhang. 2015a. DEMOS-2: Scalable E2E Verifiable Elections without Random Oracles. In CCS 2015. 352--363."},{"key":"e_1_3_2_2_60_1","volume-title":"End-to-End Verifiable Elections in the Standard Model. In EUROCRYPT","author":"Kiayias Aggelos","year":"2015","unstructured":"Aggelos Kiayias , Thomas Zacharias , and Bingsheng Zhang . 2015 b. End-to-End Verifiable Elections in the Standard Model. In EUROCRYPT 2015. 468--498. Aggelos Kiayias, Thomas Zacharias, and Bingsheng Zhang. 2015b. End-to-End Verifiable Elections in the Standard Model. In EUROCRYPT 2015. 468--498."},{"key":"e_1_3_2_2_61_1","unstructured":"Ahmed Kosba Zhichao Zhao Andrew Miller Yi Qian Hubert Chan Charalampos Papamanthou Rafael Pass Elaine Shi etal 2015. C$ptysetCptyset$: A Framework for Building Composable Zero-Knowledge Proofs. Cryptology ePrint Archive (2015).  Ahmed Kosba Zhichao Zhao Andrew Miller Yi Qian Hubert Chan Charalampos Papamanthou Rafael Pass Elaine Shi et al. 2015. C$ptysetCptyset$: A Framework for Building Composable Zero-Knowledge Proofs. Cryptology ePrint Archive (2015)."},{"key":"e_1_3_2_2_62_1","volume-title":"Ordinos: A Verifiable Tally-Hiding Remote E-Voting System","author":"K\u00fcsters Ralf","year":"2020","unstructured":"Ralf K\u00fcsters , Julian Liedtke , Johannes M\u00fcller , Daniel Rausch , and Andreas Vogt . 2020 . Ordinos: A Verifiable Tally-Hiding Remote E-Voting System . In IEEE EuroS &P 2020. Ralf K\u00fcsters, Julian Liedtke, Johannes M\u00fcller, Daniel Rausch, and Andreas Vogt. 2020. Ordinos: A Verifiable Tally-Hiding Remote E-Voting System. In IEEE EuroS&P 2020."},{"key":"e_1_3_2_2_63_1","volume-title":"CSF","author":"K\u00fcsters R.","year":"2016","unstructured":"R. K\u00fcsters , J. M\u00fcller , E. Scapin , and T. Truderung . 2016. sElect: A Lightweight Verifiable Remote Voting System . In CSF 2016 . 341--354. R. K\u00fcsters, J. M\u00fcller, E. Scapin, and T. Truderung. 2016. sElect: A Lightweight Verifiable Remote Voting System. In CSF 2016. 341--354."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"crossref","unstructured":"R. K\u00fcsters and T. Truderung. 2016. Security Analysis of Re-Encryption RPC Mix Nets. In IEEE EuroS&P 2016. IEEE Computer Society 227--242.  R. K\u00fcsters and T. Truderung. 2016. Security Analysis of Re-Encryption RPC Mix Nets. In IEEE EuroS&P 2016. IEEE Computer Society 227--242.","DOI":"10.1109\/EuroSP.2016.27"},{"key":"e_1_3_2_2_65_1","volume-title":"ACM CCS","author":"K\u00fcsters R.","year":"2010","unstructured":"R. K\u00fcsters , T. Truderung , and A. Vogt . 2010. Accountability: Definition and Relationship to Verifiability . In ACM CCS 2010 . 526--535. R. K\u00fcsters, T. Truderung, and A. Vogt. 2010. Accountability: Definition and Relationship to Verifiability. In ACM CCS 2010. 526--535."},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"crossref","unstructured":"R. K\u00fcsters T. Truderung and A. Vogt. 2011. Verifiability Privacy and Coercion-Resistance: New Insights from a Case Study. In IEEE S&P 2011. 538--553.  R. K\u00fcsters T. Truderung and A. Vogt. 2011. Verifiability Privacy and Coercion-Resistance: New Insights from a Case Study. In IEEE S&P 2011. 538--553.","DOI":"10.1109\/SP.2011.21"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"crossref","unstructured":"R. K\u00fcsters T. Truderung and A. Vogt. 2012. Clash Attacks on the Verifiability of E-Voting Systems. In IEEE S&P 2012. 395--409.  R. K\u00fcsters T. Truderung and A. Vogt. 2012. Clash Attacks on the Verifiability of E-Voting Systems. In IEEE S&P 2012. 395--409.","DOI":"10.1109\/SP.2012.32"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"crossref","unstructured":"R. K\u00fcsters T. Truderung and A. Vogt. 2014. Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking. In S&P 2014. 343--358.  R. K\u00fcsters T. Truderung and A. Vogt. 2014. Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking. In S&P 2014. 343--358.","DOI":"10.1109\/SP.2014.29"},{"key":"e_1_3_2_2_69_1","first-page":"1270","article-title":"SAVER: Snark-friendly, Additively-homomorphic, and Verifiable Encryption and decryption with Rerandomization","volume":"2019","author":"Lee Jiwon","year":"2019","unstructured":"Jiwon Lee , Jaekyoung Choi , Jihye Kim , and Hyunok Oh . 2019 . SAVER: Snark-friendly, Additively-homomorphic, and Verifiable Encryption and decryption with Rerandomization . IACR Cryptol. ePrint Arch. , Vol. 2019 (2019), 1270 . Jiwon Lee, Jaekyoung Choi, Jihye Kim, and Hyunok Oh. 2019. SAVER: Snark-friendly, Additively-homomorphic, and Verifiable Encryption and decryption with Rerandomization. IACR Cryptol. ePrint Arch. , Vol. 2019 (2019), 1270.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_70_1","unstructured":"Maine State Legislature. 2020. Ranked Choice Voting in Maine. http:\/\/legislature.maine.gov\/lawlibrary\/ranked-choice-voting-in-maine\/9509.  Maine State Legislature. 2020. Ranked Choice Voting in Maine. http:\/\/legislature.maine.gov\/lawlibrary\/ranked-choice-voting-in-maine\/9509."},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339817"},{"key":"e_1_3_2_2_72_1","volume-title":"IEEE 35rd Computer Security Foundations Symposium, CSF","author":"Mesten David","year":"2022","unstructured":"David Mesten , Johannes M\u00fcller , and Pascal Reisert . 2022 . To appear. How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis . In IEEE 35rd Computer Security Foundations Symposium, CSF , 2022. David Mesten, Johannes M\u00fcller, and Pascal Reisert. 2022. To appear. How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis. In IEEE 35rd Computer Security Foundations Symposium, CSF, 2022."},{"key":"e_1_3_2_2_73_1","unstructured":"NSW Government. 2020. Constitution Act No 32. https:\/\/legislation.nsw.gov.au\/ \/view\/act\/1902\/32.  NSW Government. 2020. Constitution Act No 32. https:\/\/legislation.nsw.gov.au\/ \/view\/act\/1902\/32."},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44709-1_12"},{"key":"e_1_3_2_2_75_1","unstructured":"Alex Ozdemir and Dan Boneh. 2021. Experimenting with Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets. IACR Cryptol. ePrint Arch. (2021) 1530.  Alex Ozdemir and Dan Boneh. 2021. Experimenting with Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets. IACR Cryptol. ePrint Arch. (2021) 1530."},{"key":"e_1_3_2_2_76_1","volume-title":"Pinocchio: Nearly Practical Verifiable Computation. In 2013 IEEE Symposium on Security and Privacy, SP 2013","author":"Parno Bryan","year":"2013","unstructured":"Bryan Parno , Jon Howell , Craig Gentry , and Mariana Raykova . 2013 . Pinocchio: Nearly Practical Verifiable Computation. In 2013 IEEE Symposium on Security and Privacy, SP 2013 , Berkeley, CA, USA, May 19--22 , 2013. IEEE Computer Society, 238--252. Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. 2013. Pinocchio: Nearly Practical Verifiable Computation. In 2013 IEEE Symposium on Security and Privacy, SP 2013, Berkeley, CA, USA, May 19--22, 2013. IEEE Computer Society, 238--252."},{"key":"e_1_3_2_2_77_1","volume-title":"Proceedings of the 11th Annual International Cryptology Conference (CRYPTO 1991)","volume":"140","author":"Pedersen Torben P.","year":"1991","unstructured":"Torben P. Pedersen . 1991 . Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing . In Proceedings of the 11th Annual International Cryptology Conference (CRYPTO 1991) (Lecture Notes in Computer Science , Vol. 576). Springer, 129-- 140 . Torben P. Pedersen. 1991. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Proceedings of the 11th Annual International Cryptology Conference (CRYPTO 1991) (Lecture Notes in Computer Science, Vol. 576). Springer, 129--140."},{"key":"e_1_3_2_2_78_1","volume-title":"Technical Director of CES","author":"Philip Wright Personal","year":"2020","unstructured":"Personal communication (email) with Philip Wright , Technical Director of CES . 2020 . Personal communication (email) with Philip Wright, Technical Director of CES. 2020."},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_19"},{"key":"e_1_3_2_2_80_1","unstructured":"Republic of Nauru. 2016. Electoral Act No. 15. http:\/\/ronlaw.gov.nr\/nauru_lpms\/files\/acts\/d83250a1ebdc56c1701fa7aa245af5b1.pdf.  Republic of Nauru. 2016. Electoral Act No. 15. http:\/\/ronlaw.gov.nr\/nauru_lpms\/files\/acts\/d83250a1ebdc56c1701fa7aa245af5b1.pdf."},{"key":"e_1_3_2_2_81_1","unstructured":"scipr-lab. 2017. libsnark. https:\/\/github.com\/scipr-lab\/libsnark.  scipr-lab. 2017. libsnark. https:\/\/github.com\/scipr-lab\/libsnark."},{"key":"e_1_3_2_2_82_1","unstructured":"Society for Industrial and Applied Mathematics (SIAM). 2019. SIAM Announces New 2020 Leadership. https:\/\/sinews.siam.org\/Details-Page\/siam-announces-new-2020-leadership-1.  Society for Industrial and Applied Mathematics (SIAM). 2019. SIAM Announces New 2020 Leadership. https:\/\/sinews.siam.org\/Details-Page\/siam-announces-new-2020-leadership-1."},{"key":"e_1_3_2_2_83_1","volume-title":"Proceedings of the 2014 ACM CCS. 703--715","author":"Springall D.","unstructured":"D. Springall , T. Finkenauer , Z. Durumeric , J. Kitcat , H. Hursti , M. MacAlpine , and J. A. Halderman . 2014. Security Analysis of the Estonian Internet Voting System . In Proceedings of the 2014 ACM CCS. 703--715 . D. Springall, T. Finkenauer, Z. Durumeric, J. Kitcat, H. Hursti, M. MacAlpine, and J. A. Halderman. 2014. Security Analysis of the Estonian Internet Voting System. In Proceedings of the 2014 ACM CCS. 703--715."},{"key":"e_1_3_2_2_84_1","first-page":"46","article-title":"New Techniques for Electronic Voting","volume":"3","author":"Szepieniec Alan","year":"2015","unstructured":"Alan Szepieniec and Bart Preneel . 2015 . New Techniques for Electronic Voting . USENIX Journal of Election Technology and Systems (JETS) , Vol. 3 , 2 (2015), 46 -- 69 . Alan Szepieniec and Bart Preneel. 2015. New Techniques for Electronic Voting. USENIX Journal of Election Technology and Systems (JETS), Vol. 3, 2 (2015), 46 -- 69.","journal-title":"USENIX Journal of Election Technology and Systems (JETS)"},{"key":"e_1_3_2_2_85_1","volume-title":"Greater London Authority Act","author":"The National Archives. 2011.","year":"1999","unstructured":"The National Archives. 2011. Greater London Authority Act 1999 . https:\/\/www.legislation.gov.uk\/ukpga\/1999\/29\/contents. The National Archives. 2011. Greater London Authority Act 1999. https:\/\/www.legislation.gov.uk\/ukpga\/1999\/29\/contents."},{"key":"e_1_3_2_2_86_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04135-8_8"},{"key":"e_1_3_2_2_87_1","volume-title":"Proceedings of the 17th ACM CCS. 1--14","author":"Wolchok S.","unstructured":"S. Wolchok , E. Wustrow , J. A. Halderman , H. K. Prasad , A. Kankipati , S. K. Sakhamuri , V. Yagati , and R. Gonggrijp . 2010. Security Analysis of India's electronic Voting Machines . In Proceedings of the 17th ACM CCS. 1--14 . S. Wolchok, E. Wustrow, J. A. Halderman, H. K. Prasad, A. Kankipati, S. K. Sakhamuri, V. Yagati, and R. Gonggrijp. 2010. Security Analysis of India's electronic Voting Machines. In Proceedings of the 17th ACM CCS. 1--14."}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560701","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:05Z","timestamp":1750182665000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560701"}},"subtitle":["Publicly Tally-Hiding Verifiable E-Voting"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":86,"alternative-id":["10.1145\/3548606.3560701","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560701","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}