{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T15:33:51Z","timestamp":1785425631956,"version":"3.56.0"},"reference-count":90,"publisher":"International Association for Cryptologic Research","issue":"3","license":[{"start":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T00:00:00Z","timestamp":1744070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2025,9,2]]},"abstract":"<jats:p>The technological advancements of the digital era have paved the way for the facilitation of electronic voting (e-voting) with promises of increased efficiency and enhanced security. In standard e-voting designs, the tally process is assigned to a committee of designated entities called talliers. Naturally, the security analysis of any e-voting system with designated talliers hinges on the assumption that a subset of the talliers follows the execution guidelines and does not attempt to breach privacy. As an alternative approach, Kiayias and Yung [PKC '02] pioneered the self-tallying elections (STE) paradigm, where the post-ballot-casting (tally) phase can be performed by any interested party, removing the need for designated talliers.<\/jats:p>\n                  <jats:p>In this work, we explore the prospect of decentralized e-voting where security is preserved under concurrent protocol executions. In particular, we provide the first comprehensive formalization of STE in the universal composability (UC) framework introduced by Canetti [FOCS '01] via an ideal functionality that captures required security properties such as voter privacy, eligibility, fairness, one-voter one-vote, and verifiability. We present a concrete instantiation, called E-cclesia, that UC-realizes our functionality. The design of E-cclesia integrates several cryptographic primitives such as signatures of knowledge for anonymous eligibility checks, dynamic accumulators for scalability, time-lock encryption for fairness, and anonymous broadcast channels for voter privacy. For the latter primitive, we provide the first UC formalization along with a novel construction based on mix-nets that utilizes layered encryption, threshold secret sharing, and equivocation techniques. Additionally, we provide the first UC formalization of dynamic accumulators without a trusted setup, along with a UC realization based on existing constructions.<\/jats:p>\n                  <jats:p>Finally, we discuss the deployment and scalability of E-cclesia. We present preliminary benchmarks of the key operations of the voting client and demonstrate the feasibility of our proposal with readily available cryptographic tools for mid-sized elections.<\/jats:p>","DOI":"10.62056\/av11fhsfg","type":"journal-article","created":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T18:49:52Z","timestamp":1759776592000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":0,"title":["E-cclesia: Universally Composable Self-Tallying Elections over Anonymous Broadcast"],"prefix":"10.62056","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3381-0696","authenticated-orcid":false,"given":"L\u00e9o","family":"Ackermann","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/015m7wh34","id-type":"ROR","asserted-by":"publisher"}],"name":"Universit\u00e9 de Rennes","place":["263 Av. G\u00e9n\u00e9ral Leclerc, Rennes, 35000, France"],"department":["IRISA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1757-1423","authenticated-orcid":false,"given":"Myrto","family":"Arapinis","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/01nrxwf90","id-type":"ROR","asserted-by":"publisher"}],"name":"The University of Edinburgh","place":["10 Crichton St, Edinburgh, Midlothian, EH8 9AB, United Kingdom"],"department":["Informatics"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8883-5755","authenticated-orcid":false,"given":"Pavlos","family":"Georgiou","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/01nrxwf90","id-type":"ROR","asserted-by":"publisher"}],"name":"The University of Edinburgh","place":["10 Crichton St, Edinburgh, Midlothian, EH8 9AB, United Kingdom"],"department":["Informatics"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3695-0385","authenticated-orcid":false,"given":"Nikolaos","family":"Lamprou","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/01nrxwf90","id-type":"ROR","asserted-by":"publisher"}],"name":"The University of Edinburgh","place":["10 Crichton St, Edinburgh, Midlothian, EH8 9AB, United Kingdom"],"department":["Informatics"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8616-4150","authenticated-orcid":false,"given":"Lenka","family":"Marekov\u00e1","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/05a28rw58","id-type":"ROR","asserted-by":"publisher"}],"name":"ETH Z\u00fcrich","place":["R\u00e4mistrasse 101, Zurich, 8092, Switzerland"],"department":["Computer Science"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5022-8543","authenticated-orcid":false,"given":"Thomas","family":"Zacharias","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/01nrxwf90","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Glasgow","place":["University Avenue, Glasgow, Glasgow City, G12 8QQ, United Kingdom"],"department":["Computing Science"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"48349","published-online":{"date-parts":[[2025,10,6]]},"reference":[{"key":"ref1:DBLP:conf\/wdag\/MovahediSZ14","series-title":"Lecture Notes in Computer Science","first-page":"567","article-title":"Secure Anonymous Broadcast","volume":"8784","author":"Mahnush Movahedi","year":"2014"},{"key":"ref2:DBLP:journals\/ieeesp\/BannetPRSW04","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MSECP.2004.1264851","article-title":"Hack-a-Vote: Security Issues with Electronic Voting\n  Systems","volume":"2","author":"Jonathan Bannet","year":"2004","journal-title":"IEEE Secur. Priv."},{"key":"ref3:JC:Chaum88","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","article-title":"The Dining Cryptographers Problem: Unconditional Sender\n  and Recipient Untraceability","volume":"1","author":"David Chaum","year":"1988","journal-title":"Journal of Cryptology"},{"key":"ref4:Lazic2013","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2013.041206","article-title":"Anonymous Broadcast Messages","volume":"4","author":"Dragan Lazic","year":"2013","journal-title":"International Journal of Advanced Computer Science and\n  Applications"},{"key":"ref5:RSA:DerHanSla15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-16715-2_7","article-title":"Revisiting Cryptographic Accumulators, Additional Properties\n  and Relations to Other Primitives","volume":"9048","author":"David Derler","year":"2015"},{"key":"ref6:DBLP:conf\/uss\/ZamaniSMK13","article-title":"Towards Provably-Secure Scalable Anonymous Broadcast","author":"Mahdi Zamani","year":"2013"},{"key":"ref7:PODC:GKKZ11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/1993806.1993832","article-title":"Adaptively secure broadcast, revisited","author":"Juan A. Garay","year":"2011"},{"key":"ref8:ESORICS:KreRyaSmy10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-15497-3_24","article-title":"Election Verifiability in Electronic Voting Protocols","volume":"6345","author":"Steve Kremer","year":"2010"},{"key":"ref9:C:CamDubRia16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-662-53015-3_8","article-title":"UC Commitments for Modular Protocol Design and\n  Applications to Revocation and Attribute Tokens","volume":"9816","author":"Jan Camenisch","year":"2016"},{"key":"ref10:VDF_Contest","volume-title":"VDF Alliance FPGA Contest Round 2 Results","author":"Supranational","year":"2020"},{"key":"ref11:STOC:DolStr82","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1145\/800070.802215","article-title":"Polynomial Algorithms for Multiple Processor Agreement","author":"Danny Dolev","year":"1982"},{"key":"ref12:DBLP:conf\/birthday\/CortierGG19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-030-19052-1_14","article-title":"Belenios: A Simple Private and Verifiable Electronic\n  Voting System","volume":"11565","author":"V\u00e9ronique Cortier","year":"2019"},{"key":"ref13:TCC:GarKiaShe22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-031-22368-6_7","article-title":"Permissionless Clock Synchronization with Public Setup","volume":"13749","author":"Juan A. Garay","year":"2022"},{"key":"ref14:CCS:KiaKohSar22","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.1145\/3548606.3560707","article-title":"PEReDi: Privacy-Enhanced, Regulated and Distributed\n  Central Bank Digital Currencies","author":"Aggelos Kiayias","year":"2022"},{"key":"ref15:DBLP:conf\/dagstuhl\/ClarksonCM07","series-title":"Dagstuhl Seminar Proceedings","article-title":"Civitas: A Secure Remote Voting System","volume":"07311","author":"Michael E. Clarkson","year":"2007"},{"key":"ref16:FC:WWIH12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-32946-3_10","article-title":"Attacking the Washington, D.C. Internet Voting System","volume":"7397","author":"Scott Wolchok","year":"2012"},{"key":"ref17:C:Pedersen91","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","article-title":"Non-Interactive and Information-Theoretic Secure Verifiable\n  Secret Sharing","volume":"576","author":"Torben P. Pedersen","year":"1992"},{"key":"ref18:ISC:GooTamHas02","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-45811-5_29","article-title":"An Efficient Dynamic and Distributed Cryptographic\n  Accumulator","volume":"2433","author":"Michael T. Goodrich","year":"2002"},{"key":"ref19:EC:KiaZacZha15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-662-46803-6_16","article-title":"End-to-End Verifiable Elections in the Standard Model","volume":"9057","author":"Aggelos Kiayias","year":"2015"},{"key":"ref20:SK20","volume-title":"Introduction to Timing Attacks!","author":"Selva Karthik","year":"2020"},{"key":"ref21:PKC:KiaYun02","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-45664-3_10","article-title":"Self-tallying Elections and Perfect Ballot Secrecy","volume":"2274","author":"Aggelos Kiayias","year":"2002"},{"key":"ref22:JS24","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1080\/19393555.2022.2138798","article-title":"BVOT: self-tallying boardroom voting with oblivious\n  transfer","volume":"33","author":"Farid Javani","year":"2024","journal-title":"Information Security Journal: A Global Perspective"},{"key":"ref23:DBLP:conf\/csfw\/Canetti04","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/CSFW.2004.24","article-title":"Universally Composable Signature, Certification, and\n  Authentication","author":"Ran Canetti","year":"2004"},{"key":"ref24:ITCS:Pietrzak19b","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2019.60","article-title":"Simple Verifiable Delay Functions","volume":"124","author":"Krzysztof Pietrzak","year":"2019"},{"key":"ref25:Penumbra","volume-title":"The Penumbra Protocol","author":"Penumbra","year":"2024"},{"key":"ref26:DBLP:journals\/iet-ifs\/HaoRZ10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1049\/IET-IFS.2008.0127","article-title":"Anonymous voting by two-round public discussion","volume":"4","author":"Feng Hao","year":"2010","journal-title":"IET Inf. Secur."},{"key":"ref27:gnark","volume-title":"ConsenSys\/gnark: v0.7.0","author":"Gautam Botrel","year":"2022"},{"key":"ref28:EC:WaiPfi89","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/3-540-46885-4_69","article-title":"The Dining Cryptographers in the Disco - Underconditional\n  Sender and Recipient Untraceability with Computationally Secure\n  Serviceability (Abstract) (Rump Session)","volume":"434","author":"Michael Waidner","year":"1990"},{"key":"ref29:EC:CraGenSch97","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","article-title":"A Secure and Optimally Efficient Multi-Authority Election\n  Scheme","volume":"1233","author":"Ronald Cramer","year":"1997"},{"key":"ref30:RSA:BalCanYak20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-030-40186-3_27","article-title":"Universally Composable Accumulators","volume":"12006","author":"Foteini Baldimtsi","year":"2020"},{"key":"ref31:PETS:DiaMurTro10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-14527-8_11","article-title":"Impact of Network Topology on Anonymity and Overhead in\n  Low-Latency Anonymity Networks","volume":"6205","author":"Claudia D\u00edaz","year":"2010"},{"key":"ref32:CCS:KiaZacZha15","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1145\/2810103.2813727","article-title":"DEMOS-2: Scalable E2E Verifiable Elections without\n  Random Oracles","author":"Aggelos Kiayias","year":"2015"},{"key":"ref33:CSF:BMSZ20","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1109\/CSF49147.2020.00030","article-title":"Anonymous Lottery In The Proof-of-Stake Setting","author":"Foteini Baldimtsi","year":"2020"},{"key":"ref34:EC:Groth16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","article-title":"On the Size of Pairing-Based Non-interactive Arguments","volume":"9666","author":"Jens Groth","year":"2016"},{"key":"ref35:FOCS:DeSPer92","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1109\/SFCS.1992.267809","article-title":"Zero-Knowledge Proofs of Knowledge Without Interaction\n  (Extended Abstract)","author":"Alfredo De Santis","year":"1992"},{"key":"ref36:C:Nielsen02a","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","article-title":"Separating Random Oracle Proofs from Complexity Theoretic\n  Proofs: The Non-committing Encryption Case","volume":"2442","author":"Jesper Buus Nielsen","year":"2002"},{"key":"ref37:PETS:ALLP07","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-75551-7_12","article-title":"Browser-Based Attacks on Tor","volume":"4776","author":"Timothy G. Abbott","year":"2007"},{"key":"ref38:Zcash","volume-title":"Zcash Protocol Specification Version 2024.5.1-112-gcf7a5c\n  [NU6]","author":"Daira Emma Hopwood","year":"2024"},{"key":"ref39:C:CamLys02","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","article-title":"Dynamic Accumulators and Application to Efficient Revocation\n  of Anonymous Credentials","volume":"2442","author":"Jan Camenisch","year":"2002"},{"key":"ref40:CCS:CorFor10","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/1866307.1866346","article-title":"Dissent: accountable anonymous group messaging","author":"Henry Corrigan-Gibbs","year":"2010"},{"key":"ref41:C:MalThy19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-030-26948-7_22","article-title":"Homomorphic Time-Lock Puzzles and Applications","volume":"11692","author":"Giulio Malavolta","year":"2019"},{"key":"ref42:SP15","article-title":"New Techniques for Electronic Voting","author":"Alan Szepieniec","year":"2015","journal-title":"USENIX Journal of Election Technology and Systems (JETS)"},{"key":"ref43:DBLP:journals\/tdsc\/LiSYYLDG22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1109\/TDSC.2020.2979856","article-title":"A Blockchain-Based Self-Tallying Voting Protocol in\n  Decentralized IoT","volume":"19","author":"Yannan Li","year":"2022","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref44:FC:Groth04","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-27809-2_10","article-title":"Efficient Maximal Privacy in Boardroom Voting and Anonymous\n  Broadcast","volume":"3110","author":"Jens Groth","year":"2004"},{"key":"ref45:ESORICS:RyaSch06","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/11863908_20","article-title":"Pr\u00eat \u00e0 Voter with Re-encryption Mixes","volume":"4189","author":"Peter Y. A. Ryan","year":"2006"},{"key":"ref46:C:BMTZ17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-63688-7_11","article-title":"Bitcoin as a Transaction Ledger: A Composable Treatment","volume":"10401","author":"Christian Badertscher","year":"2017"},{"key":"ref47:AC:AraLamZac21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-030-92075-3_14","article-title":"Astrolabous: A Universally Composable Time-Lock Encryption\n  Scheme","volume":"13091","author":"Myrto Arapinis","year":"2021"},{"key":"ref48:DBLP:conf\/ev\/KhaderSRH12","series-title":"LNI","first-page":"285","article-title":"A Fair and Robust Voting System by Broadcast","volume":"P-205","author":"Dalia Khader","year":"2012"},{"key":"ref49:EC:BDDNO21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-030-77883-5_15","article-title":"TARDIS: A Foundation of Time-Lock Puzzles in UC","volume":"12698","author":"Carsten Baum","year":"2021"},{"key":"ref50:EPRINT:AloJoa18","volume-title":"Monero - Privacy in the Blockchain","author":"Kurt M. Alonso","year":"2018"},{"key":"ref51:DBLP:journals\/tifs\/ChaumCCEPRRSSV09","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1109\/TIFS.2009.2034919","article-title":"Scantegrity II: end-to-end verifiability by voters of\n  optical scan elections through confirmation codes","volume":"4","author":"David Chaum","year":"2009","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref52:C:Merkle89a","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","article-title":"A Certified Digital Signature","volume":"435","author":"Ralph C. Merkle","year":"1990"},{"key":"ref53:DBLP:conf\/icdcs\/ChondrosZ0DMPDK16","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/ICDCS.2016.56","article-title":"D-DEMOS: A Distributed, End-to-End Verifiable, Internet\n  Voting System","author":"Nikos Chondros","year":"2016"},{"key":"ref54:wang2016self","doi-asserted-by":"publisher","first-page":"22333","DOI":"10.1103\/PhysRevA.94.022333","article-title":"Self-tallying quantum anonymous voting","volume":"94","author":"Qingle Wang","year":"2016","journal-title":"Physical Review A"},{"key":"ref55:diaz2021nym","volume-title":"The Nym network","author":"Claudia Diaz","year":"2021"},{"key":"ref56:TCC:KatLosXu20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-64381-2_14","article-title":"On the Security of Time-Lock Puzzles and Timed Commitments","volume":"12552","author":"Jonathan Katz","year":"2020"},{"key":"ref57:DBLP:journals\/cj\/ZengHYH22","doi-asserted-by":"publisher","first-page":"3020","DOI":"10.1093\/COMJNL\/BXAB123","article-title":"A Self-Tallying Electronic Voting Based on Blockchain","volume":"65","author":"Gongxian Zeng","year":"2022","journal-title":"Comput. J."},{"key":"ref58:FOCS:Canetti01","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/SFCS.2001.959888","article-title":"Universally Composable Security: A New Paradigm for\n  Cryptographic Protocols","author":"Ran Canetti","year":"2001"},{"key":"ref59:TCC:GGJKY15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-662-46494-6_7","article-title":"A Little Honesty Goes a Long Way - The Two-Tier Model for\n  Secure Multiparty Computation","volume":"9014","author":"Juan A. Garay","year":"2015"},{"key":"ref60:EC:BendMa93","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","article-title":"One-Way Accumulators: A Decentralized Alternative to\n  Digital Sinatures (Extended Abstract)","volume":"765","author":"Josh Cohen Benaloh","year":"1994"},{"key":"ref61:SCN:ReyYak16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-44618-9_16","article-title":"Efficient Asynchronous Accumulators for Distributed PKI","volume":"9841","author":"Leonid Reyzin","year":"2016"},{"key":"ref62:USENIX:Adida08","first-page":"335","article-title":"Helios: Web-based Open-Audit Voting","author":"Ben Adida","year":"2008"},{"key":"ref63:DBLP:journals\/network\/HanLYCG20","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/MNET.001.1900439","article-title":"Blockchain-Based Self-Tallying Voting System with Software\n  Updates in Decentralized IoT","volume":"34","author":"Gang Han","year":"2020","journal-title":"IEEE Netw."},{"key":"ref64:chaum2001surevote","article-title":"Surevote: technical overview","author":"David Chaum","year":"2001"},{"key":"ref65:DBLP:journals\/popets\/DasDKZ24","doi-asserted-by":"publisher","first-page":"665","DOI":"10.56553\/POPETS-2024-0136","article-title":"Are continuous stop-and-go mixnets provably secure?","volume":"2024","author":"Debajyoti Das","year":"2024","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"ref66:DBLP:journals\/cacm\/Chaum81","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","article-title":"Untraceable Electronic Mail, Return Addresses, and Digital\n  Pseudonyms","volume":"24","author":"David Chaum","year":"1981","journal-title":"Commun. ACM"},{"key":"ref67:RSW96","volume-title":"Time-lock Puzzles and Timed-release Crypto","author":"R. L. Rivest","year":"1996"},{"key":"ref68:JCJ05","series-title":"WPES '05","isbn-type":"print","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/1102199.1102213","article-title":"Coercion-Resistant Electronic Elections","author":"Ari Juels","year":"2005","ISBN":"https:\/\/id.crossref.org\/isbn\/1595932283"},{"key":"ref69:GolMic84","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic Encryption","volume":"28","author":"Shafi Goldwasser","year":"1984","journal-title":"Journal of Computer and System Sciences"},{"key":"ref70:Ethereum","volume-title":"Ethereum: A Next-Generation Smart Contract and\n  Decentralized Application Platform","author":"Vitalik Buterin","year":"2014","journal-title":"White paper"},{"key":"ref71:EC:GolJue04","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-540-24676-3_27","article-title":"Dining Cryptographers Revisited","volume":"3027","author":"Philippe Golle","year":"2004"},{"key":"ref72:C:Setty20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/978-3-030-56877-1_25","article-title":"Spartan: Efficient and General-Purpose zkSNARKs Without\n  Trusted Setup","volume":"12172","author":"Srinath Setty","year":"2020"},{"key":"ref73:AC:FujOkaOht92","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-57220-1_66","article-title":"A Practical Secret Voting Scheme for Large Scale Elections","volume":"718","author":"Atsushi Fujioka","year":"1993"},{"key":"ref74:DBLP:conf\/nsdi\/NewmanSD22","first-page":"229","article-title":"Spectrum: High-bandwidth Anonymous Broadcast","author":"Zachary Newman","year":"2022"},{"key":"ref75:DBLP:conf\/sin\/DossogneL13a","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1145\/2523514.2523542","article-title":"Blinded additively homomorphic encryption schemes for\n  self-tallying voting","author":"J\u00e9r\u00f4me Dossogne","year":"2013"},{"key":"ref76:C:Kocher96","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","article-title":"Timing Attacks on Implementations of Diffie-Hellman,\n  RSA, DSS, and Other Systems","volume":"1109","author":"Paul C. Kocher","year":"1996"},{"key":"ref77:EC:GarKiaLeo15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","article-title":"The Bitcoin Backbone Protocol: Analysis and Applications","volume":"9057","author":"Juan A. Garay","year":"2015"},{"key":"ref78:C:RotSeg20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-56877-1_17","article-title":"Generically Speeding-Up Repeated Squaring Is Equivalent to\n  Factoring: Sharp Thresholds for All Generic-Ring Delay Functions","volume":"12172","author":"Lior Rotem","year":"2020"},{"key":"ref79:JM22","volume-title":"Are voting machines too vulnerable to hacking? Georgia's\n  having that debate","author":"Joseph Marks","year":"2022"},{"key":"ref80:SP:MGGR13","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/SP.2013.34","article-title":"Zerocoin: Anonymous Distributed E-Cash from Bitcoin","author":"Ian Miers","year":"2013"},{"key":"ref81:PODC:DKMS12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1145\/2332432.2332473","article-title":"Brief announcement: breaking the $O(nm)$ bit barrier,\n  secure multiparty computation with a static adversary","author":"Varsha Dani","year":"2012"},{"key":"ref82:C:CanParPob20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/978-3-030-56784-2_27","article-title":"Fully Deniable Interactive Encryption","volume":"12170","author":"Ran Canetti","year":"2020"},{"key":"ref83:FC:McCShaHao17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-70972-7_20","article-title":"A Smart Contract for Boardroom Voting with Maximum Voter\n  Privacy","volume":"10322","author":"Patrick McCorry","year":"2017"},{"key":"ref84:DBLP:journals\/tem\/PanjaBHR20","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1109\/TEM.2020.2986371","article-title":"A Smart Contract System for Decentralized Borda Count\n  Voting","volume":"67","author":"Somnath Panja","year":"2020","journal-title":"IEEE Trans. Engineering Management"},{"key":"ref85:C:ChaLys06","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11818175_5","article-title":"On Signatures of Knowledge","volume":"4117","author":"Melissa Chase","year":"2006"},{"key":"ref86:C:AOZZ15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/978-3-662-48000-7_37","article-title":"Incoercible Multi-party Computation and Universally\n  Composable Receipt-Free Voting","volume":"9216","author":"Jo\u00ebl Alwen","year":"2015"},{"key":"ref87:Shamir79","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to Share a Secret","volume":"22","author":"Adi Shamir","year":"1979","journal-title":"Communications of the Association for Computing Machinery"},{"key":"ref88:SP:CorBonMaz15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/SP.2015.27","article-title":"Riposte: An Anonymous Messaging System Handling Millions of\n  Users","author":"Henry Corrigan-Gibbs","year":"2015"},{"key":"ref89:SP:KKKZ19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/SP.2019.00063","article-title":"Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake","author":"Thomas Kerber","year":"2019"},{"key":"ref90:ESORICS:CLNR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-11212-1_7","article-title":"Privacy-Preserving Auditing for Attribute-Based\n  Credentials","volume":"8713","author":"Jan Camenisch","year":"2014"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T20:22:36Z","timestamp":1759782156000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/2\/3\/8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,6]]},"references-count":90,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,10,6]]}},"URL":"https:\/\/doi.org\/10.62056\/av11fhsfg","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,6]]},"assertion":[{"value":"2025-04-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc2-2-68"}}