{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:44:35Z","timestamp":1769316275644,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":65,"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":"Korean Government (MSIT)","award":["2021-0-00518"],"award-info":[{"award-number":["2021-0-00518"]}]},{"name":"Korean Government (MSIT)","award":["2021-0-00532"],"award-info":[{"award-number":["2021-0-00532"]}]},{"name":"Korean Government (MSIT)","award":["2021-0-00727"],"award-info":[{"award-number":["2021-0-00727"]}]},{"name":"Nomadic Labs and the Tezos foundation"},{"name":"European Research Council (ERC)","award":["101001283"],"award-info":[{"award-number":["101001283"]}]},{"name":"Ministerio de Ciencia e Innovacion Spain","award":["RTI2018-102043-B-I00"],"award-info":[{"award-number":["RTI2018-102043-B-I00"]}]},{"name":"Ministerio de Ciencia e Innovacion Spain","award":["RED2018-102321-T"],"award-info":[{"award-number":["RED2018-102321-T"]}]},{"name":"Comunidad de Madrid","award":["S2018\/TCS-4339"],"award-info":[{"award-number":["S2018\/TCS-4339"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560677","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"455-469","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Succinct Zero-Knowledge Batch Proofs for Set Accumulators"],"prefix":"10.1145","author":[{"given":"Matteo","family":"Campanelli","sequence":"first","affiliation":[{"name":"Protocol Labs, San Francisco, CA, USA"}]},{"given":"Dario","family":"Fiore","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"}]},{"given":"Semin","family":"Han","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}]},{"given":"Jihye","family":"Kim","sequence":"additional","affiliation":[{"name":"Kookmin University, Seoul, Republic of Korea"}]},{"given":"Dimitris","family":"Kolonelos","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute & Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}]},{"given":"Hyunok","family":"Oh","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_7"},{"key":"e_1_3_2_1_2_1","volume-title":"Fiat-shamir transformation of multi-round interactive proofs. Cryptology ePrint Archive","author":"Attema Thomas","year":"2021","unstructured":"Thomas Attema , Serge Fehr , and Michael Kloo\u00df . 2021. Fiat-shamir transformation of multi-round interactive proofs. Cryptology ePrint Archive ( 2021 ). Thomas Attema, Serge Fehr, and Michael Kloo\u00df. 2021. Fiat-shamir transformation of multi-round interactive proofs. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_3_1","volume-title":"ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 271--286","author":"Backes Michael","year":"2015","unstructured":"Michael Backes , Manuel Barbosa , Dario Fiore , and Raphael M. Reischuk . 2015 . ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 271--286 . https:\/\/doi.org\/10.1109\/SP. 2015 .24 10.1109\/SP.2015.24 Michael Backes, Manuel Barbosa, Dario Fiore, and Raphael M. Reischuk. 2015. ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 271--286. https:\/\/doi.org\/10.1109\/SP.2015.24"},{"key":"e_1_3_2_1_4_1","volume-title":"Efficiency Limitations for S-Protocols for Group Homomorphisms. In TCC 2010 (LNCS ), Daniele Micciancio (Ed.)","volume":"5978","author":"Bangerter Endre","year":"2010","unstructured":"Endre Bangerter , Jan Camenisch , and Stephan Krenn . 2010 . Efficiency Limitations for S-Protocols for Group Homomorphisms. In TCC 2010 (LNCS ), Daniele Micciancio (Ed.) , Vol. 5978 . Springer, Heidelberg, 553--571. https:\/\/doi.org\/10.1007\/978--3--642--11799--2_33 10.1007\/978--3--642--11799--2_33 Endre Bangerter, Jan Camenisch, and Stephan Krenn. 2010. Efficiency Limitations for S-Protocols for Group Homomorphisms. In TCC 2010 (LNCS ), Daniele Micciancio (Ed.), Vol. 5978. Springer, Heidelberg, 553--571. https:\/\/doi.org\/10.1007\/978--3--642--11799--2_33"},{"key":"e_1_3_2_1_5_1","volume-title":"EUROCRYPT'97 (LNCS )","author":"Bari Niko","unstructured":"Niko Bari and Birgit Pfitzmann . 1997. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees . In EUROCRYPT'97 (LNCS ) , Walter Fumy (Ed.), Vol. 1233 . Springer , Heidelberg , 480--494. https:\/\/doi.org\/10.1007\/3--540--69053-0_33 10.1007\/3--540--69053-0_33 Niko Bari and Birgit Pfitzmann. 1997. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees. In EUROCRYPT'97 (LNCS ), Walter Fumy (Ed.), Vol. 1233. Springer, Heidelberg, 480--494. https:\/\/doi.org\/10.1007\/3--540--69053-0_33"},{"key":"e_1_3_2_1_6_1","unstructured":"barry WhiteHat. 2018. roll_up: Scale ethereum with SNARKs. https:\/\/github.com\/barryWhiteHat\/roll_up. (2018).  barry WhiteHat. 2018. roll_up: Scale ethereum with SNARKs. https:\/\/github.com\/barryWhiteHat\/roll_up. (2018)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_27"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_1_9_1","volume-title":"EUROCRYPT'93 (LNCS ),","author":"Benaloh Josh Cohen","unstructured":"Josh Cohen Benaloh and Michael de Mare . 1994. One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract) . In EUROCRYPT'93 (LNCS ), , Tor Helleseth (Ed.), Vol. 765 . Springer , Heidelberg , 274--285. https:\/\/doi.org\/10.1007\/3--540--48285--7_24 10.1007\/3--540--48285--7_24 Josh Cohen Benaloh and Michael de Mare. 1994. One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract). In EUROCRYPT'93 (LNCS ), , Tor Helleseth (Ed.), Vol. 765. Springer, Heidelberg, 274--285. https:\/\/doi.org\/10.1007\/3--540--48285--7_24"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-64322-8_19"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090263"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"e_1_3_2_1_13_1","volume-title":"BLS12--381: New zk-SNARK elliptic curve construction","author":"Bowe Sean","year":"2017","unstructured":"Sean Bowe . 2017. BLS12--381: New zk-SNARK elliptic curve construction . Zcash Company blog, URL: https:\/\/z. cash\/blog\/new-snark-curve ( 2017 ). Sean Bowe. 2017. BLS12--381: New zk-SNARK elliptic curve construction. Zcash Company blog, URL: https:\/\/z. cash\/blog\/new-snark-curve (2017)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522733"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Johannes Buchmann and Safuat Hamdy. 2011. A survey on IQ cryptography. In Public-Key Cryptography and Computational Number Theory. De Gruyter 1--16.  Johannes Buchmann and Safuat Hamdy. 2011. A survey on IQ cryptography. In Public-Key Cryptography and Computational Number Theory. De Gruyter 1--16.","DOI":"10.1515\/9783110881035.1"},{"key":"e_1_3_2_1_16_1","volume-title":"An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. In PKC 2009 (LNCS ), , Stanislaw Jarecki and Gene Tsudik (Eds.)","volume":"5443","author":"Camenisch Jan","year":"2009","unstructured":"Jan Camenisch , Markulf Kohlweiss , and Claudio Soriente . 2009 . An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. In PKC 2009 (LNCS ), , Stanislaw Jarecki and Gene Tsudik (Eds.) , Vol. 5443 . Springer, Heidelberg, 481--500. https:\/\/doi.org\/10.1007\/978--3--642-00468--1_27 10.1007\/978--3--642-00468--1_27 Jan Camenisch, Markulf Kohlweiss, and Claudio Soriente. 2009. An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. In PKC 2009 (LNCS ), , Stanislaw Jarecki and Gene Tsudik (Eds.), Vol. 5443. Springer, Heidelberg, 481--500. https:\/\/doi.org\/10.1007\/978--3--642-00468--1_27"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_5"},{"key":"e_1_3_2_1_18_1","volume-title":"EUROCRYPT'99 (LNCS )","author":"Camenisch Jan","unstructured":"Jan Camenisch and Markus Michels . 1999. Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes . In EUROCRYPT'99 (LNCS ) , Jacques Stern (Ed.), Vol. 1592 . Springer , Heidelberg , 107--122. https:\/\/doi.org\/10.1007\/3--540--48910-X_8 10.1007\/3--540--48910-X_8 Jan Camenisch and Markus Michels. 1999. Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes. In EUROCRYPT'99 (LNCS ), Jacques Stern (Ed.), Vol. 1592. Springer, Heidelberg, 107--122. https:\/\/doi.org\/10.1007\/3--540--48910-X_8"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339820"},{"key":"e_1_3_2_1_22_1","volume-title":"CRYPTO'97 (LNCS ),","author":"Canetti Ran","unstructured":"Ran Canetti . 1997. Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information . In CRYPTO'97 (LNCS ), , Burton S. Kaliski Jr. (Ed.), Vol. 1294 . Springer , Heidelberg , 455--469. https:\/\/doi.org\/10.1007\/BFb0052255 10.1007\/BFb0052255 Ran Canetti. 1997. Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information. In CRYPTO'97 (LNCS ), , Burton S. Kaliski Jr. (Ed.), Vol. 1294. Springer, Heidelberg, 455--469. https:\/\/doi.org\/10.1007\/BFb0052255"},{"key":"e_1_3_2_1_23_1","volume-title":"34th","author":"Canetti Ran","unstructured":"Ran Canetti , Yehuda Lindell , Rafail Ostrovsky , and Amit Sahai . 2002. Universally composable two-party and multi-party secure computation . In 34th ACM STOC. ACM Press , 494--503. https:\/\/doi.org\/10.1145\/509907.509980 10.1145\/509907.509980 Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. 2002. Universally composable two-party and multi-party secure computation. In 34th ACM STOC. ACM Press, 494--503. https:\/\/doi.org\/10.1145\/509907.509980"},{"key":"e_1_3_2_1_24_1","volume-title":"Vector Commitments and Their Applications. In PKC 2013 (LNCS ), , Kaoru Kurosawa and Goichiro Hanaoka (Eds.)","volume":"7778","author":"Catalano Dario","year":"2013","unstructured":"Dario Catalano and Dario Fiore . 2013 . Vector Commitments and Their Applications. In PKC 2013 (LNCS ), , Kaoru Kurosawa and Goichiro Hanaoka (Eds.) , Vol. 7778 . Springer, Heidelberg, 55--72. https:\/\/doi.org\/10.1007\/978--3--642--36362--7_5 10.1007\/978--3--642--36362--7_5 Dario Catalano and Dario Fiore. 2013. Vector Commitments and Their Applications. In PKC 2013 (LNCS ), , Kaoru Kurosawa and Goichiro Hanaoka (Eds.), Vol. 7778. Springer, Heidelberg, 55--72. https:\/\/doi.org\/10.1007\/978--3--642--36362--7_5"},{"key":"e_1_3_2_1_25_1","volume-title":"Reducing participation costs via incremental verification for ledger systems. Cryptology ePrint Archive","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 ( 2020 ). Weikeng Chen, Alessandro Chiesa, Emma Dauterman, and Nicholas P Ward. 2020. Reducing participation costs via incremental verification for ledger systems. Cryptology ePrint Archive (2020)."},{"key":"e_1_3_2_1_26_1","volume-title":"Edrax: A Cryptocurrency with Stateless Transaction Validation. Cryptology ePrint Archive, Report 2018\/968.","author":"Chepurnoy Alexander","year":"2018","unstructured":"Alexander Chepurnoy , Charalampos Papamanthou , Shravan Srinivasan , and Yupeng Zhang . 2018 b. Edrax: A Cryptocurrency with Stateless Transaction Validation. Cryptology ePrint Archive, Report 2018\/968. (2018). https:\/\/ia.cr\/2018\/968. Alexander Chepurnoy, Charalampos Papamanthou, Shravan Srinivasan, and Yupeng Zhang. 2018b. Edrax: A Cryptocurrency with Stateless Transaction Validation. Cryptology ePrint Archive, Report 2018\/968. (2018). https:\/\/ia.cr\/2018\/968."},{"key":"e_1_3_2_1_27_1","volume-title":"Edrax: A Cryptocurrency with Stateless Transaction Validation. Cryptology ePrint Archive, Report 2018\/968.","author":"Chepurnoy Alexander","year":"2018","unstructured":"Alexander Chepurnoy , Charalampos Papamanthou , and Yupeng Zhang . 2018 a. Edrax: A Cryptocurrency with Stateless Transaction Validation. Cryptology ePrint Archive, Report 2018\/968. (2018). https:\/\/eprint.iacr.org\/2018\/968. Alexander Chepurnoy, Charalampos Papamanthou, and Yupeng Zhang. 2018a. Edrax: A Cryptocurrency with Stateless Transaction Validation. Cryptology ePrint Archive, Report 2018\/968. (2018). https:\/\/eprint.iacr.org\/2018\/968."},{"key":"e_1_3_2_1_28_1","volume-title":"Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme. In EUROCRYPT 2000 (LNCS ), Bart Preneel (Ed.)","volume":"1807","author":"Coron Jean-S\u00e9bastien","year":"2000","unstructured":"Jean-S\u00e9bastien Coron and David Naccache . 2000 . Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme. In EUROCRYPT 2000 (LNCS ), Bart Preneel (Ed.) , Vol. 1807 . Springer, Heidelberg, 91--101. https:\/\/doi.org\/10.1007\/3--540--45539--6_7 10.1007\/3--540--45539--6_7 Jean-S\u00e9bastien Coron and David Naccache. 2000. Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme. In EUROCRYPT 2000 (LNCS ), Bart Preneel (Ed.), Vol. 1807. Springer, Heidelberg, 91--101. https:\/\/doi.org\/10.1007\/3--540--45539--6_7"},{"key":"e_1_3_2_1_29_1","volume-title":"Geppetto: Versatile Verifiable Computation. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 253--270","author":"Costello Craig","year":"2015","unstructured":"Craig Costello , C\u00e9dric Fournet , Jon Howell , Markulf Kohlweiss , Benjamin Kreuter , Michael Naehrig , Bryan Parno , and Samee Zahur . 2015 . Geppetto: Versatile Verifiable Computation. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 253--270 . https:\/\/doi.org\/10.1109\/SP.2015.23 10.1109\/SP.2015.23 Craig Costello, C\u00e9dric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, and Samee Zahur. 2015. Geppetto: Versatile Verifiable Computation. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 253--270. https:\/\/doi.org\/10.1109\/SP.2015.23"},{"key":"e_1_3_2_1_30_1","volume-title":"Modular design of secure yet practical cryptographic protocols. Ph. D. Thesis","author":"Cramer Ronald","year":"1996","unstructured":"Ronald Cramer . 1996. Modular design of secure yet practical cryptographic protocols. Ph. D. Thesis , CWI and University of Amsterdam ( 1996 ). Ronald Cramer. 1996. Modular design of secure yet practical cryptographic protocols. Ph. D. Thesis, CWI and University of Amsterdam (1996)."},{"key":"e_1_3_2_1_31_1","unstructured":"Ivan Damgard Carmit Hazay and Angela Zottarel. 2014. Short Paper On the Generic Hardness of DDH-II. (2014).  Ivan Damgard Carmit Hazay and Angela Zottarel. 2014. Short Paper On the Generic Hardness of DDH-II. (2014)."},{"key":"e_1_3_2_1_32_1","volume-title":"Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups. In EUROCRYPT 2002 (LNCS ), , Lars R. Knudsen (Ed.)","volume":"2332","author":"Damg\u00e5rd Ivan","year":"2002","unstructured":"Ivan Damg\u00e5rd and Maciej Koprowski . 2002 . Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups. In EUROCRYPT 2002 (LNCS ), , Lars R. Knudsen (Ed.) , Vol. 2332 . Springer, Heidelberg, 256--271. https:\/\/doi.org\/10.1007\/3--540--46035--7_17 10.1007\/3--540--46035--7_17 Ivan Damg\u00e5rd and Maciej Koprowski. 2002. Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups. In EUROCRYPT 2002 (LNCS ), , Lars R. Knudsen (Ed.), Vol. 2332. Springer, Heidelberg, 256--271. https:\/\/doi.org\/10.1007\/3--540--46035--7_17"},{"key":"e_1_3_2_1_33_1","unstructured":"Justin Drake. 2017. Accumulators scalability of UTXO blockchains and data availability. https:\/\/ethresear.ch\/t\/accumulators-scalability-of-utxo-blockchains-and-data-availability\/176. (2017).  Justin Drake. 2017. Accumulators scalability of UTXO blockchains and data availability. https:\/\/ethresear.ch\/t\/accumulators-scalability-of-utxo-blockchains-and-data-availability\/176. (2017)."},{"key":"e_1_3_2_1_34_1","volume-title":"CRYPTO'86 (LNCS ), , Andrew M","author":"Fiat Amos","unstructured":"Amos Fiat and Adi Shamir . 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems . In CRYPTO'86 (LNCS ), , Andrew M . Odlyzko (Ed.), Vol. 263 . Springer , Heidelberg , 186--194. https:\/\/doi.org\/10.1007\/3--540--47721--7_12 10.1007\/3--540--47721--7_12 Amos Fiat and Adi Shamir. 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In CRYPTO'86 (LNCS ), , Andrew M. Odlyzko (Ed.), Vol. 263. Springer, Heidelberg, 186--194. https:\/\/doi.org\/10.1007\/3--540--47721--7_12"},{"key":"e_1_3_2_1_35_1","volume-title":"Hash First","author":"Fiore Dario","year":"2016","unstructured":"Dario Fiore , C\u00e9dric Fournet , Esha Ghosh , Markulf Kohlweiss , Olga Ohrimenko , and Bryan Parno . 2016. Hash First , Argue Later : Adaptive Verifiable Computations on Outsourced Data. In ACM CCS 2016 , , Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi (Eds.). ACM Press , 1304--1316. https:\/\/doi.org\/10.1145\/2976749.2978368 10.1145\/2976749.2978368 Dario Fiore, C\u00e9dric Fournet, Esha Ghosh, Markulf Kohlweiss, Olga Ohrimenko, and Bryan Parno. 2016. Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data. In ACM CCS 2016, , Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi (Eds.). ACM Press, 1304--1316. https:\/\/doi.org\/10.1145\/2976749.2978368"},{"key":"e_1_3_2_1_36_1","volume-title":"Pointproofs: Aggregating Proofs for Multiple Vector Commitments. In ACM CCS 2020","author":"Gorbunov Sergey","year":"2020","unstructured":"Sergey Gorbunov , Leonid Reyzin , Hoeteck Wee , and Zhenfei Zhang . 2020 . Pointproofs: Aggregating Proofs for Multiple Vector Commitments. In ACM CCS 2020 , , Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press , 2007--2023. https:\/\/doi.org\/10.1145\/3372297.3417244 10.1145\/3372297.3417244 Sergey Gorbunov, Leonid Reyzin, Hoeteck Wee, and Zhenfei Zhang. 2020. Pointproofs: Aggregating Proofs for Multiple Vector Commitments. In ACM CCS 2020, , Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press, 2007--2023. https:\/\/doi.org\/10.1145\/3372297.3417244"},{"key":"e_1_3_2_1_37_1","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Grassi Lorenzo","year":"2021","unstructured":"Lorenzo Grassi , Dmitry Khovratovich , Christian Rechberger , Arnab Roy , and Markus Schofnegger . 2021 . Poseidon: A new hash function for zero-knowledge proof systems . In 30th USENIX Security Symposium (USENIX Security 21) . Lorenzo Grassi, Dmitry Khovratovich, Christian Rechberger, Arnab Roy, and Markus Schofnegger. 2021. Poseidon: A new hash function for zero-knowledge proof systems. In 30th USENIX Security Symposium (USENIX Security 21)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_39_1","volume-title":"TRUESET: Faster Verifiable Set Computations. In USENIX Security","author":"Kosba Ahmed E.","year":"2014","unstructured":"Ahmed E. Kosba , Dimitrios Papadopoulos , Charalampos Papamanthou , Mahmoud F. Sayed , Elaine Shi , and Nikos Triandopoulos . 2014 . TRUESET: Faster Verifiable Set Computations. In USENIX Security 2014, , Kevin Fu and Jaeyeon Jung (Eds.). USENIX Association , 765--780. Ahmed E. Kosba, Dimitrios Papadopoulos, Charalampos Papamanthou, Mahmoud F. Sayed, Elaine Shi, and Nikos Triandopoulos. 2014. TRUESET: Faster Verifiable Set Computations. In USENIX Security 2014, , Kevin Fu and Jaeyeon Jung (Eds.). USENIX Association, 765--780."},{"key":"e_1_3_2_1_40_1","volume-title":"CRYPTO","volume":"11692","author":"Russell W.","year":"2019","unstructured":"Russell W. F. Lai and Giulio Malavolta. 2019. Subvector Commitments with Application to Succinct Arguments . In CRYPTO 2019 , Part I (LNCS ), Alexandra Boldyreva and Daniele Micciancio (Eds.) , Vol. 11692 . Springer, Heidelberg, 530--560. https:\/\/doi.org\/10.1007\/978--3-030--26948--7_19 10.1007\/978--3-030--26948--7_19 Russell W. F. Lai and Giulio Malavolta. 2019. Subvector Commitments with Application to Succinct Arguments. In CRYPTO 2019, Part I (LNCS ), Alexandra Boldyreva and Daniele Micciancio (Eds.), Vol. 11692. Springer, Heidelberg, 530--560. https:\/\/doi.org\/10.1007\/978--3-030--26948--7_19"},{"key":"e_1_3_2_1_41_1","volume-title":"ACNS 07 (LNCS )","author":"Li Jiangtao","unstructured":"Jiangtao Li , Ninghui Li , and Rui Xue . 2007. Universal Accumulators with Efficient Nonmembership Proofs . In ACNS 07 (LNCS ) , Jonathan Katz and Moti Yung (Eds.), Vol. 4521 . Springer , Heidelberg , 253--269. https:\/\/doi.org\/10.1007\/978--3--540--72738--5_17 10.1007\/978--3--540--72738--5_17 Jiangtao Li, Ninghui Li, and Rui Xue. 2007. Universal Accumulators with Efficient Nonmembership Proofs. In ACNS 07 (LNCS ), Jonathan Katz and Moti Yung (Eds.), Vol. 4521. Springer, Heidelberg, 253--269. https:\/\/doi.org\/10.1007\/978--3--540--72738--5_17"},{"key":"e_1_3_2_1_42_1","volume-title":"10th IMA International Conference on Cryptography and Coding (LNCS ), , Nigel P. Smart (Ed.)","volume":"3796","author":"Maurer Ueli M.","year":"2005","unstructured":"Ueli M. Maurer . 2005 . Abstract Models of Computation in Cryptography (Invited Paper) . In 10th IMA International Conference on Cryptography and Coding (LNCS ), , Nigel P. Smart (Ed.) , Vol. 3796 . Springer, Heidelberg, 1--12. Ueli M. Maurer. 2005. Abstract Models of Computation in Cryptography (Invited Paper). In 10th IMA International Conference on Cryptography and Coding (LNCS ), , Nigel P. Smart (Ed.), Vol. 3796. Springer, Heidelberg, 1--12."},{"key":"e_1_3_2_1_43_1","volume-title":"CRYPTO'87 (LNCS )","author":"Merkle Ralph C.","unstructured":"Ralph C. Merkle . 1988. A Digital Signature Based on a Conventional Encryption Function . In CRYPTO'87 (LNCS ) , Carl Pomerance (Ed.), Vol. 293 . Springer , Heidelberg , 369--378. https:\/\/doi.org\/10.1007\/3--540--48184--2_32 10.1007\/3--540--48184--2_32 Ralph C. Merkle. 1988. A Digital Signature Based on a Conventional Encryption Function. In CRYPTO'87 (LNCS ), Carl Pomerance (Ed.), Vol. 293. Springer, Heidelberg, 369--378. https:\/\/doi.org\/10.1007\/3--540--48184--2_32"},{"key":"e_1_3_2_1_44_1","volume-title":"35th","author":"Micali Silvio","year":"1994","unstructured":"Silvio Micali . 1994. CS Proofs ( Extended Abstracts). In 35th FOCS. IEEE Computer Society Press , 436--453. https:\/\/doi.org\/10.1109\/SFCS. 1994 .365746 10.1109\/SFCS.1994.365746 Silvio Micali. 1994. CS Proofs (Extended Abstracts). In 35th FOCS. IEEE Computer Society Press, 436--453. https:\/\/doi.org\/10.1109\/SFCS.1994.365746"},{"key":"e_1_3_2_1_45_1","volume-title":"CT-RSA 2005 (LNCS )","author":"Nguyen Lan","unstructured":"Lan Nguyen . 2005. Accumulators from Bilinear Pairings and Applications . In CT-RSA 2005 (LNCS ) , Alfred Menezes (Ed.), Vol. 3376 . Springer , Heidelberg , 275--292. https:\/\/doi.org\/10.1007\/978--3--540--30574--3_19 10.1007\/978--3--540--30574--3_19 Lan Nguyen. 2005. Accumulators from Bilinear Pairings and Applications. In CT-RSA 2005 (LNCS ), Alfred Menezes (Ed.), Vol. 3376. Springer, Heidelberg, 275--292. https:\/\/doi.org\/10.1007\/978--3--540--30574--3_19"},{"key":"e_1_3_2_1_46_1","volume-title":"USENIX Security","author":"Ozdemir Alex","year":"2020","unstructured":"Alex Ozdemir , Riad S. Wahby , Barry Whitehat , and Dan Boneh . 2020. Scaling Verifiable Computation Using Efficient Set Accumulators . In USENIX Security 2020 , , Srdjan Capkun and Franziska Roesner (Eds.). USENIX Association , 2075--2092. Alex Ozdemir, Riad S. Wahby, Barry Whitehat, and Dan Boneh. 2020. Scaling Verifiable Computation Using Efficient Set Accumulators. In USENIX Security 2020, , Srdjan Capkun and Franziska Roesner (Eds.). USENIX Association, 2075--2092."},{"key":"e_1_3_2_1_47_1","volume-title":"Streaming Authenticated Data Structures. In EUROCRYPT 2013 (LNCS ), , Thomas Johansson and Phong Q. Nguyen (Eds.)","volume":"7881","author":"Papamanthou Charalampos","year":"2013","unstructured":"Charalampos Papamanthou , Elaine Shi , Roberto Tamassia , and Ke Yi . 2013 . Streaming Authenticated Data Structures. In EUROCRYPT 2013 (LNCS ), , Thomas Johansson and Phong Q. Nguyen (Eds.) , Vol. 7881 . Springer, Heidelberg, 353--370. https:\/\/doi.org\/10.1007\/978--3--642--38348--9_22 10.1007\/978--3--642--38348--9_22 Charalampos Papamanthou, Elaine Shi, Roberto Tamassia, and Ke Yi. 2013. Streaming Authenticated Data Structures. In EUROCRYPT 2013 (LNCS ), , Thomas Johansson and Phong Q. Nguyen (Eds.), Vol. 7881. Springer, Heidelberg, 353--370. https:\/\/doi.org\/10.1007\/978--3--642--38348--9_22"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055817"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.2307\/2006496"},{"key":"e_1_3_2_1_50_1","volume-title":"CRYPTO'99 (LNCS ), , Michael J","author":"Sander Tomas","unstructured":"Tomas Sander and Amnon Ta-Shma . 1999. Auditable , Anonymous Electronic Cash . In CRYPTO'99 (LNCS ), , Michael J . Wiener (Ed.), Vol. 1666 . Springer , Heidelberg , 555--572. https:\/\/doi.org\/10.1007\/3--540--48405--1_35 10.1007\/3--540--48405--1_35 Tomas Sander and Amnon Ta-Shma. 1999. Auditable, Anonymous Electronic Cash. In CRYPTO'99 (LNCS ), , Michael J. Wiener (Ed.), Vol. 1666. Springer, Heidelberg, 555--572. https:\/\/doi.org\/10.1007\/3--540--48405--1_35"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/357353.357357"},{"key":"e_1_3_2_1_52_1","volume-title":"EUROCRYPT'97 (LNCS )","author":"Shoup Victor","unstructured":"Victor Shoup . 1997. Lower Bounds for Discrete Logarithms and Related Problems . In EUROCRYPT'97 (LNCS ) , Walter Fumy (Ed.), Vol. 1233 . Springer , Heidelberg , 256--266. https:\/\/doi.org\/10.1007\/3--540--69053-0_18 10.1007\/3--540--69053-0_18 Victor Shoup. 1997. Lower Bounds for Discrete Logarithms and Related Problems. In EUROCRYPT'97 (LNCS ), Walter Fumy (Ed.), Vol. 1233. Springer, Heidelberg, 256--266. https:\/\/doi.org\/10.1007\/3--540--69053-0_18"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Roberto Tamassia. 2003. Authenticated Data Structures. In ESA.  Roberto Tamassia. 2003. Authenticated Data Structures. In ESA.","DOI":"10.1007\/978-3-540-39658-1_2"},{"key":"e_1_3_2_1_54_1","volume-title":"SCN 12 (LNCS )","author":"Terelius Bj\u00f6rn","unstructured":"Bj\u00f6rn Terelius and Douglas Wikstr\u00f6m . 2012. Efficiency Limitations of S-Protocols for Group Homomorphisms Revisited . In SCN 12 (LNCS ) , Ivan Visconti and Roberto De Prisco (Eds.), Vol. 7485 . Springer , Heidelberg , 461--476. https:\/\/doi.org\/10.1007\/978--3--642--32928--9_26 10.1007\/978--3--642--32928--9_26 Bj\u00f6rn Terelius and Douglas Wikstr\u00f6m. 2012. Efficiency Limitations of S-Protocols for Group Homomorphisms Revisited. In SCN 12 (LNCS ), Ivan Visconti and Roberto De Prisco (Eds.), Vol. 7485. Springer, Heidelberg, 461--476. https:\/\/doi.org\/10.1007\/978--3--642--32928--9_26"},{"key":"e_1_3_2_1_55_1","unstructured":"Peter Todd. 2016a. Making UTXO Set Growth Irrelevant With Low-Latency Delayed TXO Commitments. https:\/\/petertodd.org\/2016\/delayed-txo-commitments. (2016).  Peter Todd. 2016a. Making UTXO Set Growth Irrelevant With Low-Latency Delayed TXO Commitments. https:\/\/petertodd.org\/2016\/delayed-txo-commitments. (2016)."},{"key":"e_1_3_2_1_56_1","volume-title":"2016 b. Making UTXO Set Growth Irrelevant With Low-Latency Delayed TXO Commitments. https:\/\/petertodd.org\/2016\/delayed-txo-commitments. (","author":"Todd Peter","year":"2016","unstructured":"Peter Todd . 2016 b. Making UTXO Set Growth Irrelevant With Low-Latency Delayed TXO Commitments. https:\/\/petertodd.org\/2016\/delayed-txo-commitments. ( 2016 ). Peter Todd. 2016 b. Making UTXO Set Growth Irrelevant With Low-Latency Delayed TXO Commitments. https:\/\/petertodd.org\/2016\/delayed-txo-commitments. ( 2016)."},{"key":"e_1_3_2_1_57_1","volume-title":"SCN 20 (LNCS )","author":"Tomescu Alin","unstructured":"Alin Tomescu , Ittai Abraham , Vitalik Buterin , Justin Drake , Dankrad Feist , and Dmitry Khovratovich . 2020. Aggregatable Subvector Commitments for Stateless Cryptocurrencies . In SCN 20 (LNCS ) , Clemente Galdi and Vladimir Kolesnikov (Eds.), Vol. 12238 . Springer , Heidelberg , 45--64. https:\/\/doi.org\/10.1007\/978--3-030--57990--6_3 10.1007\/978--3-030--57990--6_3 Alin Tomescu, Ittai Abraham, Vitalik Buterin, Justin Drake, Dankrad Feist, and Dmitry Khovratovich. 2020. Aggregatable Subvector Commitments for Stateless Cryptocurrencies. In SCN 20 (LNCS ), Clemente Galdi and Vladimir Kolesnikov (Eds.), Vol. 12238. Springer, Heidelberg, 45--64. https:\/\/doi.org\/10.1007\/978--3-030--57990--6_3"},{"key":"e_1_3_2_1_58_1","volume-title":"https:\/\/www.hyperledger.org\/use\/hyperledger-indy. (","author":"Hyperledger Indy V.A.","year":"2022","unstructured":"V.A. 2022a. Hyperledger Indy . https:\/\/www.hyperledger.org\/use\/hyperledger-indy. ( 2022 ). V.A. 2022a. Hyperledger Indy. https:\/\/www.hyperledger.org\/use\/hyperledger-indy. ( 2022)."},{"key":"e_1_3_2_1_59_1","volume-title":"https:\/\/iden3.io. (","author":"V.A.","year":"2022","unstructured":"V.A. 2022b. Iden3. https:\/\/iden3.io. ( 2022 ). V.A. 2022b. Iden3. https:\/\/iden3.io. ( 2022)."},{"key":"e_1_3_2_1_60_1","volume-title":"jsnark. https:\/\/github.com\/akosba\/jsnark. (","author":"V.A.","year":"2022","unstructured":"V.A. 2022c. jsnark. https:\/\/github.com\/akosba\/jsnark. ( 2022 ). V.A. 2022c. jsnark. https:\/\/github.com\/akosba\/jsnark. ( 2022)."},{"key":"e_1_3_2_1_61_1","unstructured":"V.A. 2022d. libsnark. https:\/\/github.com\/scipr-lab\/libsnark. (2022).  V.A. 2022d. libsnark. https:\/\/github.com\/scipr-lab\/libsnark. (2022)."},{"key":"e_1_3_2_1_62_1","volume-title":"2022 e. Sovrin. https:\/\/sovrin.org. (","author":"A.","year":"2022","unstructured":"V. A. 2022 e. Sovrin. https:\/\/sovrin.org. ( 2022 ). V.A. 2022 e. Sovrin. https:\/\/sovrin.org. ( 2022)."},{"key":"e_1_3_2_1_63_1","volume-title":"2022 f. Zcash. https:\/\/z.cash. (","author":"A.","year":"2022","unstructured":"V. A. 2022 f. Zcash. https:\/\/z.cash. ( 2022 ). V.A. 2022 f. Zcash. https:\/\/z.cash. ( 2022)."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2641562"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_13"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.43"}],"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.3560677","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560677","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:59Z","timestamp":1750182539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":65,"alternative-id":["10.1145\/3548606.3560677","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560677","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"}}]}}