{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:22:49Z","timestamp":1766442169290,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3744796","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:37:25Z","timestamp":1763854645000},"page":"409-422","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["KZH-Fold: Accountable Voting from Sublinear Accumulation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2771-0145","authenticated-orcid":false,"given":"George","family":"Kadianakis","sequence":"first","affiliation":[{"name":"Ethereum Foundation, Athens, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9587-8494","authenticated-orcid":false,"given":"Arantxa","family":"Zapico","sequence":"additional","affiliation":[{"name":"Ethereum Foundation, C\u00f3rdoba, Argentina"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1974-7708","authenticated-orcid":false,"given":"Hossein","family":"Hafezi","sequence":"additional","affiliation":[{"name":"New York University, New York, New York, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2082-4480","authenticated-orcid":false,"given":"Benedikt","family":"B\u00fcnz","sequence":"additional","affiliation":[{"name":"New York University, New York, New York, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Marius A. Aardal Diego F. Aranha Katharina Boudgoust Sebastian Kolby and Akira Takahashi. 2024. Aggregating falcon signatures with LaBRADOR. In 71--106. doi: 10.1007\/978--3-031--68376--3_3.","DOI":"10.1007\/978--3-031--68376--3_3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014--9196--7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","unstructured":"Balthazar Bauer Georg Fuchsbauer and Julian Loss. 2020. A classification of computational assumptions in the algebraic group model. In 121--151. doi: 10.1007\/978--3-030--56880--1_5.","DOI":"10.1007\/978--3-030--56880--1_5"},{"key":"e_1_3_2_1_4_1","volume-title":"Handel: practical multi-signature aggregation for large byzantine committees. (2019). https:\/\/arxiv.org\/abs\/1906.05132 arXiv","author":"B\u00e9gassat Olivier","year":"1906","unstructured":"Olivier B\u00e9gassat, Blazej Kolad, Nicolas Gailly, and Nicolas Liochon. 2019. Handel: practical multi-signature aggregation for large byzantine committees. (2019). https:\/\/arxiv.org\/abs\/1906.05132 arXiv: 1906.05132 [cs.DC]."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"Eli Ben-Sasson Alessandro Chiesa Eran Tromer and Madars Virza. 2014. Scalable zero knowledge via cycles of elliptic curves. In 276--294. doi: 10.1007\/978--3--662--44381--1_16.","DOI":"10.1007\/978--3--662--44381--1_16"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Dan Boneh Justin Drake Ben Fisch and Ariel Gabizon. 2021. Halo infinite: proof-carrying data from additive polynomial commitments. In 649--680. doi: 10.1007\/978--3-030--84242-0_23.","DOI":"10.1007\/978--3-030--84242-0_23"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Dan Boneh Manu Drijvers and Gregory Neven. 2018. Compact multi-signatures for smaller blockchains. In 435--464. doi: 10.1007\/978--3-030-03329--3_15.","DOI":"10.1007\/978--3-030-03329--3_15"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0314--9"},{"key":"e_1_3_2_1_9_1","volume-title":"Paper 2020\/352.","author":"Bonneau Joseph","year":"2020","unstructured":"Joseph Bonneau, Izaak Meckler, Vanishree Rao, and Evan Shapiro. 2020. Coda: decentralized cryptocurrency at scale. Cryptology ePrint Archive, Paper 2020\/352. (2020). https:\/\/eprint.iacr.org\/2020\/352."},{"key":"e_1_3_2_1_10_1","unstructured":"Sean Bowe Jack Grigg and Daira Hopwood. 2019. Halo: recursive proof composition without a trusted setup. Cryptology ePrint Archive Report 2019\/1021. (2019). https:\/\/eprint.iacr.org\/2019\/1021."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Benedikt B\u00fcnz and Binyi Chen. 2023. Protostar: generic efficient accumulation\/folding for special-sound protocols. In 77--110. doi: 10.1007\/978--981--99--8724--5_3.","DOI":"10.1007\/978--981--99--8724--5_3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Benedikt B\u00fcnz Alessandro Chiesa William Lin Pratyush Mishra and Nicholas Spooner. 2021. Proof-carrying data without succinct arguments. In 681--710. doi: 10.1007\/978--3-030--84242-0_24.","DOI":"10.1007\/978--3-030--84242-0_24"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"Benedikt B\u00fcnz Alessandro Chiesa Pratyush Mishra and Nicholas Spooner. 2020. Recursive proof composition from accumulation schemes. In 1--18. doi: 10.1007\/978--3-030--64378--2_1.","DOI":"10.1007\/978--3-030--64378--2_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Benedikt B\u00fcnz Ben Fisch and Alan Szepieniec. 2020. Transparent SNARKs from DARK compilers. In 677--706. doi: 10.1007\/978--3-030--45721--1_24.","DOI":"10.1007\/978--3-030--45721--1_24"},{"key":"e_1_3_2_1_15_1","volume-title":"Paper 2019\/1177.","author":"B\u00fcnz Benedikt","year":"2019","unstructured":"Benedikt B\u00fcnz, Mary Maller, Pratyush Mishra, Nirvan Tyagi, and Psi Vesely. 2019. Proofs for inner pairing products and applications. Cryptology ePrint Archive, Paper 2019\/1177. (2019). https:\/\/eprint.iacr.org\/2019\/1177."},{"key":"e_1_3_2_1_16_1","unstructured":"Vitalik Buterin. [n. d.] Possible futures of the ethereum protocol part 1: the merge. https:\/\/vitalik.eth.limo\/general\/2024\/10\/14\/futures1.html. Accessed: 2024--11--15. ()."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Binyi Chen Benedikt B\u00fcnz Dan Boneh and Zhenfei Zhang. 2023. HyperPlonk: plonk with linear-time prover and high-degree custom gates. In 499--530. doi: 10.1007\/978--3-031--30617--4_17.","DOI":"10.1007\/978--3-031--30617--4_17"},{"key":"e_1_3_2_1_18_1","volume-title":"Ward","author":"Chen Weikeng","year":"2020","unstructured":"Weikeng Chen, Alessandro Chiesa, Emma Dauterman, and Nicholas P. Ward. 2020. Reducing participation costs via incremental verification for ledger systems. Cryptology ePrint Archive, Paper 2020\/1522. (2020). https:\/\/eprint.iacr.org\/2020\/1522."},{"key":"e_1_3_2_1_19_1","unstructured":"Alessandro Chiesa and Eran Tromer. 2010. Proof-carrying data and hearsay arguments from signature cards. In 310--331."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","unstructured":"Alessandro Chiesa Eran Tromer and Madars Virza. 2015. Cluster computing in zero knowledge. In 371--403. doi: 10.1007\/978--3--662--46803--6_13.","DOI":"10.1007\/978--3--662--46803--6_13"},{"key":"e_1_3_2_1_21_1","volume-title":"Ertem Nusret Tas, and David Tse","author":"D'Amato Francesco","year":"2022","unstructured":"Francesco D'Amato, Joachim Neu, Ertem Nusret Tas, and David Tse. 2022. No more attacks on proof-of-stake ethereum? Cryptology ePrint Archive, Report 2022\/1171. (2022). https:\/\/eprint.iacr.org\/2022\/1171."},{"key":"e_1_3_2_1_22_1","unstructured":"Francesco D'Amato Roberto Saltini Thanh-Hai Tran and Luca Zanolini. 2024. 3-slot-finality protocol for ethereum. (2024). https:\/\/arxiv.org\/abs\/2411.00558 arXiv: 2411.00558 [cs.DC]."},{"key":"e_1_3_2_1_23_1","unstructured":"Francesco D'Amato Roberto Saltini Thanh-Hai Tran and Luca Zanolini. 2024. Tob-svd: total-order broadcast with single-vote decisions in the sleepy model. (2024). https:\/\/arxiv.org\/abs\/2310.11331 arXiv: 2310.11331 [cs.DC]."},{"key":"e_1_3_2_1_24_1","unstructured":"Francesco D'Amato and Luca Zanolini. 2023. A simple single slot finality protocol for ethereum. Cryptology ePrint Archive Report 2023\/280. (2023). https:\/\/eprint.iacr.org\/2023\/280."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","unstructured":"Vanesa Daza Carla R\u00e0fols and Alexandros Zacharakis. 2020. Updateable inner product argument with logarithmic verifier and applications. In 527--557. doi:10.1007\/978--3-030--45374--9_18.","DOI":"10.1007\/978--3-030--45374--9_18"},{"key":"e_1_3_2_1_26_1","unstructured":"Yossi Gilad Rotem Hemo Silvio Micali Georgios Vlachos and Nickolai Zeldovich. 2017. Algorand: scaling byzantine agreements for cryptocurrencies. Cryptology ePrint Archive Report 2017\/454. (2017). https:\/\/eprint.iacr.org\/2017\/454."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","unstructured":"Jens Groth Markulf Kohlweiss Mary Maller Sarah Meiklejohn and Ian Miers. 2018. Updatable and universal common reference strings with applications to zk-SNARKs. In 698--728. doi: 10.1007\/978--3--319--96878-0_24.","DOI":"10.1007\/978--3--319--96878-0_24"},{"key":"e_1_3_2_1_28_1","unstructured":"Polygon Hermez. 2024. Polygon zkevm: recursion aggregation and composition of proofs. https:\/\/github.com\/0xPolygonHermez\/zkevm-techdocs\/blob\/main\/docs\/proof-recursion.pdf. Accessed: 2024--11--15. (2024). https:\/\/github.com\/0xPolygonHermez\/zkevm-techdocs\/blob\/main\/docs\/proof-recursion.pdf."},{"key":"e_1_3_2_1_29_1","volume-title":"Paper 2025\/144.","author":"Kadianakis George","year":"2025","unstructured":"George Kadianakis, Arantxa Zapico, Hossein Hafezi, and Benedikt B\u00fcnz. 2025. KZH-fold: accountable voting from sublinear accumulation. Cryptology ePrint Archive, Paper 2025\/144. (2025). https:\/\/eprint.iacr.org\/2025\/144."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","unstructured":"Aniket Kate Gregory M. Zaverucha and Ian Goldberg. 2010. Constant-size commitments to polynomials and their applications. In 177--194. doi: 10.1007\/978--3--642--17373--8_11.","DOI":"10.1007\/978--3--642--17373--8_11"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","unstructured":"Assimakis Kattis and Joseph Bonneau. 2023. Proof of necessary work: succinct state verification with fairness guarantees. In 18--35. doi: 10.1007\/978--3-031--47751--5_2.","DOI":"10.1007\/978--3-031--47751--5_2"},{"key":"e_1_3_2_1_32_1","unstructured":"Irakliy Khaburzaniya Konstantinos Chalkias Kevin Lewi and Harjasleen Malvai. 2021. Aggregating hash-based signatures using STARKs. Cryptology ePrint Archive Report 2021\/1048. (2021). https:\/\/eprint.iacr.org\/2021\/1048."},{"key":"e_1_3_2_1_33_1","unstructured":"Abhiram Kothapalli and Srinath Setty. 2023. CycleFold: folding-scheme-based recursive arguments over a cycle of elliptic curves. Cryptology ePrint Archive Report 2023\/1192. (2023). https:\/\/eprint.iacr.org\/2023\/1192."},{"key":"e_1_3_2_1_34_1","volume-title":"Paper 2023\/1192.","author":"Kothapalli Abhiram","year":"2023","unstructured":"Abhiram Kothapalli and Srinath Setty. 2023. CycleFold: folding-scheme-based recursive arguments over a cycle of elliptic curves. Cryptology ePrint Archive, Paper 2023\/1192. (2023). https:\/\/eprint.iacr.org\/2023\/1192."},{"key":"e_1_3_2_1_35_1","volume-title":"Paper 2023\/573.","author":"Kothapalli Abhiram","year":"2023","unstructured":"Abhiram Kothapalli and Srinath Setty. 2023. HyperNova: recursive arguments for customizable constraint systems. Cryptology ePrint Archive, Paper 2023\/573. (2023). https:\/\/eprint.iacr.org\/2023\/573."},{"key":"e_1_3_2_1_36_1","unstructured":"Abhiram Kothapalli and Srinath Setty. 2022. SuperNova: proving universal machine executions without universal circuits. Cryptology ePrint Archive Report 2022\/1758. (2022). https:\/\/eprint.iacr.org\/2022\/1758."},{"key":"e_1_3_2_1_37_1","volume-title":"Paper 2022\/1758.","author":"Kothapalli Abhiram","year":"2022","unstructured":"Abhiram Kothapalli and Srinath Setty. 2022. SuperNova: proving universal machine executions without universal circuits. Cryptology ePrint Archive, Paper 2022\/1758. (2022). https:\/\/eprint.iacr.org\/2022\/1758."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","unstructured":"Abhiram Kothapalli Srinath Setty and Ioanna Tzialla. 2022. Nova: recursive zero-knowledge arguments from folding schemes. In 359--388. doi: 10.1007\/978--3-031--15985--5_13.","DOI":"10.1007\/978--3-031--15985--5_13"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--68403--6_11"},{"key":"e_1_3_2_1_40_1","volume-title":"Paper 2023\/1271.","author":"Liu Tianyi","year":"2023","unstructured":"Tianyi Liu, Tiancheng Xie, Jiaheng Zhang, Dawn Song, and Yupeng Zhang. 2023. Pianist: scalable zkRollups via fully distributed zero-knowledge proofs. Cryptology ePrint Archive, Paper 2023\/1271. (2023). https:\/\/eprint.iacr.org\/2023\/1271."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","unstructured":"Carsten Lund Lance Fortnow Howard J. Karloff and Noam Nisan. 1990. Algebraic methods for interactive proof systems. In 2--10. doi: 10.1109\/FSCS.1990.89518.","DOI":"10.1109\/FSCS.1990.89518"},{"key":"e_1_3_2_1_42_1","unstructured":"[n. d.] Ova: a slightly better nova. https:\/\/hackmd.io\/V4838nnlRKal9ZiTHiGYzw. Accessed: 2024--11--15. ()."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","unstructured":"Torben P. Pedersen. 1992. Non-interactive and information-theoretic secure verifiable secret sharing. In 129--140. doi: 10.1007\/3--540--46766--1_9.","DOI":"10.1007\/3--540--46766--1_9"},{"key":"e_1_3_2_1_44_1","unstructured":"Ethereum Research. [n. d.] Signature merging for large-scale consensus. https:\/\/ethresear.ch\/t\/signature- merging- for- large- scale- consensus\/17386. Accessed: 2024--11--15. ()."},{"key":"e_1_3_2_1_45_1","unstructured":"Ethereum Research. [n. d.] Sticking to 8192 signatures per slot post-ssf: how and why. https:\/\/ethresear.ch\/t\/sticking-to-8192-signatures-per-slot-post-ssf-how-and-why\/. Accessed: 2024--11--15. ()."},{"key":"e_1_3_2_1_46_1","volume-title":"Paper 2024\/1208.","author":"Rosenberg Michael","year":"2024","unstructured":"Michael Rosenberg, Tushar Mopuri, Hossein Hafezi, Ian Miers, and Pratyush Mishra. 2024. Hekaton: horizontally-scalable zkSNARKs via proof aggregation. Cryptology ePrint Archive, Paper 2024\/1208. (2024). https:\/\/eprint.iacr.org\/2024\/1208."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","unstructured":"Srinath Setty. 2020. Spartan: efficient and general-purpose zkSNARKs without trusted setup. In 704--737. doi: 10.1007\/978--3-030--56877--1_25.","DOI":"10.1007\/978--3-030--56877--1_25"},{"key":"e_1_3_2_1_48_1","unstructured":"[n. d.] Single slot finality. https:\/\/ethereum.org\/en\/roadmap\/single-slot-finality\/. Accessed: 2024--11--15. ()."},{"key":"e_1_3_2_1_49_1","volume-title":"Justin Thaler, and Michael Walfish.","author":"Wahby Riad S.","year":"2017","unstructured":"Riad S. Wahby, Ioanna Tzialla, abhi shelat, Justin Thaler, and Michael Walfish. 2017. Doubly-efficient zkSNARKs without trusted setup. Cryptology ePrint Archive, Paper 2017\/1132. (2017). https:\/\/eprint.iacr.org\/2017\/1132."},{"key":"e_1_3_2_1_50_1","volume-title":"Paper 2024\/1873.","author":"Wang Wenhao","year":"2024","unstructured":"Wenhao Wang, Fangyan Shi, Dani Vilardell, and Fan Zhang. 2024. Cirrus: performant and accountable distributed SNARK. Cryptology ePrint Archive, Paper 2024\/1873. (2024). https:\/\/eprint.iacr.org\/2024\/1873."},{"key":"e_1_3_2_1_51_1","volume-title":"Raluca Ada Popa, and Ion Stoica","author":"Wu Howard","year":"2018","unstructured":"Howard Wu, Wenting Zheng, Alessandro Chiesa, Raluca Ada Popa, and Ion Stoica. 2018. DIZK: a distributed zero knowledge proof system. Cryptology ePrint Archive, Paper 2018\/691. (2018). https:\/\/eprint.iacr.org\/2018\/691."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","unstructured":"Maofan Yin Dahlia Malkhi Michael K. Reiter Guy Golan-Gueta and Ittai Abraham. 2019. HotStuff: BFT consensus with linearity and responsiveness. In 347--356. doi: 10.1145\/3293611.3331591.","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_3_2_1_53_1","volume-title":"Paper 2024\/2099.","author":"Zhao Jiaxing","year":"2024","unstructured":"Jiaxing Zhao, Srinath Setty, and Weidong Cui. 2024. MicroNova: folding-based arguments with efficient (on-chain) verification. Cryptology ePrint Archive, Paper 2024\/2099. (2024). https:\/\/eprint.iacr.org\/2024\/2099."}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Taipei Taiwan","acronym":"CCS '25"},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3744796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:21:38Z","timestamp":1766442098000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3744796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":53,"alternative-id":["10.1145\/3719027.3744796","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3744796","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}