{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:54Z","timestamp":1750220874602,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3354247","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"685-702","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Verified Verifiers for Verifying Elections"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Haines","sequence":"first","affiliation":[{"name":"Norwegian University of Science and Technology, Trondheim, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Gor\u00e9","sequence":"additional","affiliation":[{"name":"Australian National University, Canberra, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mukesh","family":"Tiwari","sequence":"additional","affiliation":[{"name":"Australian National University, Canberra, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Helios: Web-based Open-Audit Voting. In USENIX Security Symposium, Paul C. van Oorschot (Ed.). USENIX Association, 335--348","author":"Adida Ben","year":"2008","unstructured":"Ben Adida . 2008 . Helios: Web-based Open-Audit Voting. In USENIX Security Symposium, Paul C. van Oorschot (Ed.). USENIX Association, 335--348 . Ben Adida. 2008. Helios: Web-based Open-Audit Voting. In USENIX Security Symposium, Paul C. van Oorschot (Ed.). USENIX Association, 335--348."},{"key":"e_1_3_2_2_2_1","volume-title":"15th European Symposium on Research in Computer Security, Athens, Greece, September 20--22, 2010. Proceedings. 151--167","author":"Almeida Jos\u00e9 Bacelar","year":"2010","unstructured":"Jos\u00e9 Bacelar Almeida , Endre Bangerter , Manuel Barbosa , Stephan Krenn , Ahmad-Reza Sadeghi , and Thomas Schneider . 2010 . A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols. In Computer Security - ESORICS 2010 , 15th European Symposium on Research in Computer Security, Athens, Greece, September 20--22, 2010. Proceedings. 151--167 . https:\/\/doi.org\/10.1007\/978--3--642--15497--3_10 10.1007\/978--3--642--15497--3_10 Jos\u00e9 Bacelar Almeida, Endre Bangerter, Manuel Barbosa, Stephan Krenn, Ahmad-Reza Sadeghi, and Thomas Schneider. 2010. A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols. In Computer Security - ESORICS 2010, 15th European Symposium on Research in Computer Security, Athens, Greece, September 20--22, 2010. Proceedings. 151--167. https:\/\/doi.org\/10.1007\/978--3--642--15497--3_10"},{"key":"e_1_3_2_2_3_1","volume-title":"the ACM Conference on Computer and Communications Security, CCS'12","author":"Almeida Jos\u00e9 Bacelar","year":"2012","unstructured":"Jos\u00e9 Bacelar Almeida , Manuel Barbosa , Endre Bangerter , Gilles Barthe , Stephan Krenn , and Santiago Zanella B\u00e9 guelin. 2012 . Full proof cryptography: verifiable compilation of efficient zero-knowledge protocols . In the ACM Conference on Computer and Communications Security, CCS'12 , Raleigh, NC, USA, October 16--18 , 2012. 488--500. https:\/\/doi.org\/10.1145\/2382196.2382249 10.1145\/2382196.2382249 Jos\u00e9 Bacelar Almeida, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan Krenn, and Santiago Zanella B\u00e9 guelin. 2012. Full proof cryptography: verifiable compilation of efficient zero-knowledge protocols. In the ACM Conference on Computer and Communications Security, CCS'12, Raleigh, NC, USA, October 16--18, 2012. 488--500. https:\/\/doi.org\/10.1145\/2382196.2382249"},{"volume-title":"Verifiable Side-Channel Security of Cryptographic Implementations: Constant-Time MEE-CBC","author":"Almeida Jos\u00e9 Bacelar","key":"e_1_3_2_2_4_1","unstructured":"Jos\u00e9 Bacelar Almeida , Manuel Barbosa , Gilles Barthe , and Francc ois Dupressoir . 2016. Verifiable Side-Channel Security of Cryptographic Implementations: Constant-Time MEE-CBC . In Fast Software Encryption, Thomas Peyrin (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 163--184. Jos\u00e9 Bacelar Almeida, Manuel Barbosa, Gilles Barthe, and Francc ois Dupressoir. 2016. Verifiable Side-Channel Security of Cryptographic Implementations: Constant-Time MEE-CBC. In Fast Software Encryption, Thomas Peyrin (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 163--184."},{"key":"e_1_3_2_2_5_1","volume-title":"Benjamin Gr\u00e9 goire, and Sylvain Heraud.","author":"Barthe Gilles","year":"2010","unstructured":"Gilles Barthe , Daniel Hedin , Santiago Zanella B\u00e9 guelin , Benjamin Gr\u00e9 goire, and Sylvain Heraud. 2010 . A Machine-Checked Formalization of Sigma-Protocols. In CSF. IEEE Computer Society , 246--260. Gilles Barthe, Daniel Hedin, Santiago Zanella B\u00e9 guelin, Benjamin Gr\u00e9 goire, and Sylvain Heraud. 2010. A Machine-Checked Formalization of Sigma-Protocols. In CSF. IEEE Computer Society, 246--260."},{"volume-title":"EUROCRYPT (Lecture Notes in Computer Science)","author":"Bayer Stephanie","key":"e_1_3_2_2_6_1","unstructured":"Stephanie Bayer and Jens Groth . 2012. Efficient Zero-Knowledge Argument for Correctness of a Shuffle . In EUROCRYPT (Lecture Notes in Computer Science) , Vol. 7237 . Springer , 263--280. Stephanie Bayer and Jens Groth. 2012. Efficient Zero-Knowledge Argument for Correctness of a Shuffle. In EUROCRYPT (Lecture Notes in Computer Science), Vol. 7237. Springer, 263--280."},{"volume-title":"CRYPTO (Lecture Notes in Computer Science)","author":"Bellare Mihir","key":"e_1_3_2_2_7_1","unstructured":"Mihir Bellare and Oded Goldreich . 1992. On Defining Proofs of Knowledge . In CRYPTO (Lecture Notes in Computer Science) , Vol. 740 . Springer , 390--420. Mihir Bellare and Oded Goldreich. 1992. On Defining Proofs of Knowledge. In CRYPTO (Lecture Notes in Computer Science), Vol. 740. Springer, 390--420."},{"volume-title":"Ballot Casting Assurance via Voter-Initiated Poll Station Auditing","author":"Benaloh Josh","key":"e_1_3_2_2_8_1","unstructured":"Josh Benaloh . 2007. Ballot Casting Assurance via Voter-Initiated Poll Station Auditing . In EVT. USENIX Association . Josh Benaloh. 2007. Ballot Casting Assurance via Voter-Initiated Poll Station Auditing. In EVT. USENIX Association."},{"volume-title":"Verified Correctness and Security of OpenSSL HMAC. In 24th USENIX Security Symposium (USENIX Security 15)","author":"Beringer Lennart","key":"e_1_3_2_2_9_1","unstructured":"Lennart Beringer , Adam Petcher , Katherine Q. Ye , and Andrew W. Appel . 2015 . Verified Correctness and Security of OpenSSL HMAC. In 24th USENIX Security Symposium (USENIX Security 15) . USENIX Association, Washington, D.C., 207--221. https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/beringer Lennart Beringer, Adam Petcher, Katherine Q. Ye, and Andrew W. Appel. 2015. Verified Correctness and Security of OpenSSL HMAC. In 24th USENIX Security Symposium (USENIX Security 15). USENIX Association, Washington, D.C., 207--221. https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/beringer"},{"key":"e_1_3_2_2_10_1","volume-title":"Proceedings (Lecture Notes in Computer Science), Vijay Atluri and Claudia D'i az (Eds.)","volume":"6879","author":"Bernhard David","year":"2011","unstructured":"David Bernhard , V\u00e9 ronique Cortier , Olivier Pereira , Ben Smyth , and Bogdan Warinschi . 2011 . Adapting Helios for Provable Ballot Privacy. In Computer Security - ESORICS 2011 - 16th European Symposium on Research in Computer Security, Leuven, Belgium, September 12--14, 2011 . Proceedings (Lecture Notes in Computer Science), Vijay Atluri and Claudia D'i az (Eds.) , Vol. 6879 . Springer, 335--354. https:\/\/doi.org\/10.1007978--3--642--23822--2_19 David Bernhard, V\u00e9 ronique Cortier, Olivier Pereira, Ben Smyth, and Bogdan Warinschi. 2011. Adapting Helios for Provable Ballot Privacy. In Computer Security - ESORICS 2011 - 16th European Symposium on Research in Computer Security, Leuven, Belgium, September 12--14, 2011. Proceedings (Lecture Notes in Computer Science), Vijay Atluri and Claudia D'i az (Eds.), Vol. 6879. Springer, 335--354. https:\/\/doi.org\/10.1007978--3--642--23822--2_19"},{"volume-title":"ASIACRYPT (Lecture Notes in Computer Science)","author":"Bernhard David","key":"e_1_3_2_2_11_1","unstructured":"David Bernhard , Olivier Pereira , and Bogdan Warinschi . 2012. How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios . In ASIACRYPT (Lecture Notes in Computer Science) , Vol. 7658 . Springer , 626--643. David Bernhard, Olivier Pereira, and Bogdan Warinschi. 2012. How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios. In ASIACRYPT (Lecture Notes in Computer Science), Vol. 7658. Springer, 626--643."},{"volume-title":"Interactive theorem proving and program development : Coq'Art : the calculus of inductive constructions","author":"Bertot Yves","key":"e_1_3_2_2_12_1","unstructured":"Yves Bertot , Pierre Cast\u00e9ran , G\u00e9rard Huet , and Christine Paulin-Mohring . 2004. Interactive theorem proving and program development : Coq'Art : the calculus of inductive constructions . Springer . Yves Bertot, Pierre Cast\u00e9ran, G\u00e9rard Huet, and Christine Paulin-Mohring. 2004. Interactive theorem proving and program development : Coq'Art : the calculus of inductive constructions .Springer."},{"key":"e_1_3_2_2_13_1","unstructured":"BFH-EVG. 2018. UniCrypt. https:\/\/github.com\/bfh-evg\/unicrypt. (2018).  BFH-EVG. 2018. UniCrypt. https:\/\/github.com\/bfh-evg\/unicrypt. (2018)."},{"volume-title":"E-VOTE-ID (Lecture Notes in Computer Science)","author":"Bruni Alessandro","key":"e_1_3_2_2_14_1","unstructured":"Alessandro Bruni , Eva Drewsen , and Carsten Sch\u00fc rmann. 2017. Towards a Mechanized Proof of Selene Receipt-Freeness and Vote-Privacy . In E-VOTE-ID (Lecture Notes in Computer Science) , Vol. 10615 . Springer , 110--126. Alessandro Bruni, Eva Drewsen, and Carsten Sch\u00fc rmann. 2017. Towards a Mechanized Proof of Selene Receipt-Freeness and Vote-Privacy. In E-VOTE-ID (Lecture Notes in Computer Science), Vol. 10615. Springer, 110--126."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660370"},{"key":"e_1_3_2_2_17_1","volume-title":"Francc ois Dupressoir, and Bogdan Warinschi.","author":"Cortier V\u00e9","year":"2018","unstructured":"V\u00e9 ronique Cortier , Constantin Catalin Dragan , Francc ois Dupressoir, and Bogdan Warinschi. 2018 . Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios. In CSF. IEEE Computer Society , 298--312. V\u00e9 ronique Cortier, Constantin Catalin Dragan, Francc ois Dupressoir, and Bogdan Warinschi. 2018. Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios. In CSF. IEEE Computer Society, 298--312."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2595846.2595849"},{"key":"e_1_3_2_2_19_1","unstructured":"Ronald Cramer. 1997. Modular Design of Secure yet Practical Cryptographic Protocols.  Ronald Cramer. 1997. Modular Design of Secure yet Practical Cryptographic Protocols."},{"volume-title":"CRYPTO (Lecture Notes in Computer Science)","author":"Cramer Ronald","key":"e_1_3_2_2_20_1","unstructured":"Ronald Cramer , Ivan Damg\u00e5rd , and Berry Schoenmakers . 1994. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols . In CRYPTO (Lecture Notes in Computer Science) , Vol. 839 . Springer , 174--187. Ronald Cramer, Ivan Damg\u00e5rd, and Berry Schoenmakers. 1994. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In CRYPTO (Lecture Notes in Computer Science), Vol. 839. Springer, 174--187."},{"volume-title":"IFIPTM (IFIP Advances in Information and Communication Technology)","author":"Delaune St\u00e9","key":"e_1_3_2_2_21_1","unstructured":"St\u00e9 phanie Delaune , Mark Ryan , and Ben Smyth . 2008. Automatic Verification of Privacy Properties in the Applied pi Calculus . In IFIPTM (IFIP Advances in Information and Communication Technology) , Vol. 263 . Springer , 263--278. St\u00e9 phanie Delaune, Mark Ryan, and Ben Smyth. 2008. Automatic Verification of Privacy Properties in the Applied pi Calculus. In IFIPTM (IFIP Advances in Information and Communication Technology), Vol. 263. Springer, 263--278."},{"key":"e_1_3_2_2_22_1","volume-title":"Without Compromises. In 2019 2019 IEEE Symposium on Security and Privacy (SP). IEEE Computer Society","author":"Erbsen A.","year":"2019","unstructured":"A. Erbsen , J. Philipoom , J. Gross , R. Sloan , and A. Chlipala . 2019. Simple High-Level Code for Cryptographic Arithmetic - With Proofs , Without Compromises. In 2019 2019 IEEE Symposium on Security and Privacy (SP). IEEE Computer Society , Los Alamitos, CA, USA. https:\/\/doi.org\/10.1109\/SP. 2019 .00005 10.1109\/SP.2019.00005 A. Erbsen, J. Philipoom, J. Gross, R. Sloan, and A. Chlipala. 2019. Simple High-Level Code for Cryptographic Arithmetic - With Proofs, Without Compromises. In 2019 2019 IEEE Symposium on Security and Privacy (SP). IEEE Computer Society, Los Alamitos, CA, USA. https:\/\/doi.org\/10.1109\/SP.2019.00005"},{"volume-title":"CRYPTO (Lecture Notes in Computer Science)","author":"Fiat Amos","key":"e_1_3_2_2_23_1","unstructured":"Amos Fiat and Adi Shamir . 1986. How to Prove Yourself: Practical Solutions to Identification and Signature Problems . In CRYPTO (Lecture Notes in Computer Science) , Vol. 263 . Springer , 186--194. Amos Fiat and Adi Shamir. 1986. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In CRYPTO (Lecture Notes in Computer Science), Vol. 263. Springer, 186--194."},{"volume-title":"CRYPTO (Lecture Notes in Computer Science)","author":"Furukawa Jun","key":"e_1_3_2_2_24_1","unstructured":"Jun Furukawa and Kazue Sako . 2001. An Efficient Scheme for Proving a Shuffle . In CRYPTO (Lecture Notes in Computer Science) , Vol. 2139 . Springer , 368--387. Jun Furukawa and Kazue Sako. 2001. An Efficient Scheme for Proving a Shuffle. In CRYPTO (Lecture Notes in Computer Science), Vol. 2139. Springer, 368--387."},{"volume-title":"CRYPTO (Lecture Notes in Computer Science)","author":"Gamal Taher El","key":"e_1_3_2_2_25_1","unstructured":"Taher El Gamal . 1984. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms . In CRYPTO (Lecture Notes in Computer Science) , Vol. 196 . Springer , 10--18. Taher El Gamal. 1984. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In CRYPTO (Lecture Notes in Computer Science), Vol. 196. Springer, 10--18."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"volume-title":"Selected Papers from the International Workshop on Types for Proofs and Programs (TYPES '00)","author":"Geuvers Herman","key":"e_1_3_2_2_27_1","unstructured":"Herman Geuvers , Freek Wiedijk , and Jan Zwanenburg . 2002. A Constructive Proof of the Fundamental Theorem of Algebra Without Using the Rationals . In Selected Papers from the International Workshop on Types for Proofs and Programs (TYPES '00) . Springer-Verlag, Berlin , Heidelberg , 96--111. http:\/\/dl.acm.org\/citation.cfm?id=646540.696038 Herman Geuvers, Freek Wiedijk, and Jan Zwanenburg. 2002. A Constructive Proof of the Fundamental Theorem of Algebra Without Using the Rationals. In Selected Papers from the International Workshop on Types for Proofs and Programs (TYPES '00). Springer-Verlag, Berlin, Heidelberg, 96--111. http:\/\/dl.acm.org\/citation.cfm?id=646540.696038"},{"volume-title":"E-VOTE-ID (Lecture Notes in Computer Science)","author":"Ghale Milad K.","key":"e_1_3_2_2_28_1","unstructured":"Milad K. Ghale , Rajeev Gor\u00e9 , and Dirk Pattinson . 2017. A Formally Verified Single Transferable Voting Scheme with Fractional Values . In E-VOTE-ID (Lecture Notes in Computer Science) , Vol. 10615 . Springer , 163--182. Milad K. Ghale, Rajeev Gor\u00e9, and Dirk Pattinson. 2017. A Formally Verified Single Transferable Voting Scheme with Fractional Values. In E-VOTE-ID (Lecture Notes in Computer Science), Vol. 10615. Springer, 163--182."},{"volume-title":"E-Vote-ID (Lecture Notes in Computer Science)","author":"Ghale Milad K.","key":"e_1_3_2_2_29_1","unstructured":"Milad K. Ghale , Rajeev Gor\u00e9 , Dirk Pattinson , and Mukesh Tiwari . 2018. Modular Formalisation and Verification of STV Algorithms . In E-Vote-ID (Lecture Notes in Computer Science) , Vol. 11143 . Springer , 51--66. Milad K. Ghale, Rajeev Gor\u00e9, Dirk Pattinson, and Mukesh Tiwari. 2018. Modular Formalisation and Verification of STV Algorithms. In E-Vote-ID (Lecture Notes in Computer Science), Vol. 11143. Springer, 51--66."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Shafi Goldwasser Silvio Micali and Charles Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). In STOC. ACM 291--304.  Shafi Goldwasser Silvio Micali and Charles Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). In STOC. ACM 291--304.","DOI":"10.1145\/22145.22178"},{"volume-title":"The Four Colour Theorem: Engineering of a Formal Proof","author":"Gonthier Georges","key":"e_1_3_2_2_31_1","unstructured":"Georges Gonthier . 2008. The Four Colour Theorem: Engineering of a Formal Proof . In Computer Mathematics, Deepak Kapur (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 333--333. Georges Gonthier. 2008. The Four Colour Theorem: Engineering of a Formal Proof. In Computer Mathematics, Deepak Kapur (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 333--333."},{"key":"e_1_3_2_2_32_1","volume-title":"A Description and Proof of a Generalised and Optimised Variant of Wikstr\u00f6 m's Mixnet. CoRR","author":"Haines Thomas","year":"2019","unstructured":"Thomas Haines . 2019. A Description and Proof of a Generalised and Optimised Variant of Wikstr\u00f6 m's Mixnet. CoRR , Vol. abs\/ 1901 .08371 ( 2019 ). Thomas Haines. 2019. A Description and Proof of a Generalised and Optimised Variant of Wikstr\u00f6 m's Mixnet. CoRR, Vol. abs\/1901.08371 (2019)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22270-7_3"},{"volume-title":"E-Vote-ID (Lecture Notes in Computer Science)","author":"Jamroga Wojciech","key":"e_1_3_2_2_34_1","unstructured":"Wojciech Jamroga , Michal Knapik , and Damian Kurpiewski . 2018. Model Checking the SELENE E-Voting Protocol in Multi-agent Logics . In E-Vote-ID (Lecture Notes in Computer Science) , Vol. 11143 . Springer , 100--116. Wojciech Jamroga, Michal Knapik, and Damian Kurpiewski. 2018. Model Checking the SELENE E-Voting Protocol in Multi-agent Logics. In E-Vote-ID (Lecture Notes in Computer Science), Vol. 11143. Springer, 100--116."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535841"},{"key":"e_1_3_2_2_36_1","volume-title":"Clash Attacks on the Verifiability of E-Voting Systems. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 395--409","author":"Ralf K\u00fc","year":"2012","unstructured":"Ralf K\u00fc sters, Tomasz Truderung , and Andreas Vogt . 2012 . Clash Attacks on the Verifiability of E-Voting Systems. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 395--409 . Ralf K\u00fc sters, Tomasz Truderung, and Andreas Vogt. 2012. Clash Attacks on the Verifiability of E-Voting Systems. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 395--409."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39185-1_12"},{"volume-title":"E-VOTE-ID (Lecture Notes in Computer Science)","author":"Moses Lyria Bennett","key":"e_1_3_2_2_38_1","unstructured":"Lyria Bennett Moses , Rajeev Gor\u00e9 , Ron Levy , Dirk Pattinson , and Mukesh Tiwari . 2017. No More Excuses: Automated Synthesis of Practical and Verifiable Vote-Counting Programs for Complex Voting Schemes . In E-VOTE-ID (Lecture Notes in Computer Science) , Vol. 10615 . Springer , 66--83. Lyria Bennett Moses, Rajeev Gor\u00e9, Ron Levy, Dirk Pattinson, and Mukesh Tiwari. 2017. No More Excuses: Automated Synthesis of Practical and Verifiable Vote-Counting Programs for Complex Voting Schemes. In E-VOTE-ID (Lecture Notes in Computer Science), Vol. 10615. Springer, 66--83."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502000"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2008.0149"},{"key":"e_1_3_2_2_41_1","volume-title":"Clarkson","author":"Smyth Ben","year":"2015","unstructured":"Ben Smyth , Steven Frink , and Michael R . Clarkson . 2015 . Election Verifiability : Cryptographic Definitions and an Analysis of Helios, Helios-C, and JCJ. Cryptology ePrint Archive, Report 2015\/233. (2015). https:\/\/eprint.iacr.org\/2015\/233. Ben Smyth, Steven Frink, and Michael R. Clarkson. 2015. Election Verifiability: Cryptographic Definitions and an Analysis of Helios, Helios-C, and JCJ. Cryptology ePrint Archive, Report 2015\/233. (2015). https:\/\/eprint.iacr.org\/2015\/233."},{"volume-title":"ARSPA-WITS (Lecture Notes in Computer Science)","author":"Smyth Ben","key":"e_1_3_2_2_42_1","unstructured":"Ben Smyth , Mark Ryan , Steve Kremer , and Mounira Kourjieh . 2010. Towards Automatic Analysis of Election Verifiability Properties . In ARSPA-WITS (Lecture Notes in Computer Science) , Vol. 6186 . Springer , 146--163. Ben Smyth, Mark Ryan, Steve Kremer, and Mounira Kourjieh. 2010. Towards Automatic Analysis of Election Verifiability Properties. In ARSPA-WITS (Lecture Notes in Computer Science), Vol. 6186. Springer, 146--163."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660315"},{"key":"e_1_3_2_2_44_1","unstructured":"The state of Geneva. 2018. CHVote. https:\/\/github.com\/republique-et-canton-de-geneve\/chvote-protocol-poc. (2018).  The state of Geneva. 2018. CHVote. https:\/\/github.com\/republique-et-canton-de-geneve\/chvote-protocol-poc. (2018)."},{"volume-title":"Proofs of Restricted Shuffles","author":"Terelius Bj\u00f6rn","key":"e_1_3_2_2_46_1","unstructured":"Bj\u00f6rn Terelius and Douglas Wikstr\u00f6m . 2010. Proofs of Restricted Shuffles . In AFRICACRYPT. Springer , 100--113. Bj\u00f6rn Terelius and Douglas Wikstr\u00f6m. 2010. Proofs of Restricted Shuffles. In AFRICACRYPT. Springer, 100--113."},{"volume-title":"Information Security and Privacy","author":"Wikstr\u00f6m Douglas","key":"e_1_3_2_2_47_1","unstructured":"Douglas Wikstr\u00f6m . 2009. A commitment-consistent proof of a shuffle . In Information Security and Privacy . Springer , 407--421. Douglas Wikstr\u00f6m. 2009. A commitment-consistent proof of a shuffle. In Information Security and Privacy. Springer, 407--421."},{"key":"e_1_3_2_2_48_1","unstructured":"Douglas Wikstr\u00f6m. 2018. Verificatum. https:\/\/github.com\/verificatum\/verificatum-vcr. (2018).  Douglas Wikstr\u00f6m. 2018. Verificatum. https:\/\/github.com\/verificatum\/verificatum-vcr. (2018)."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134043"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"London United Kingdom","acronym":"CCS '19"},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354247","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:24:03Z","timestamp":1750202643000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":48,"alternative-id":["10.1145\/3319535.3354247","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3354247","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}