{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:09:41Z","timestamp":1765112981212,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":80,"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":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR00112020022"],"award-info":[{"award-number":["HR00112020022"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-1940713,CNS-1930117,CNS-2026774,CNS-2154174"],"award-info":[{"award-number":["CNS-1940713,CNS-1930117,CNS-2026774,CNS-2154174"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560605","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"2793-2807","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["VeRSA"],"prefix":"10.1145","author":[{"given":"Nirvan","family":"Tyagi","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Ben","family":"Fisch","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Andrew","family":"Zitek","sequence":"additional","affiliation":[{"name":"New York University, New York City, NY, USA"}]},{"given":"Joseph","family":"Bonneau","sequence":"additional","affiliation":[{"name":"New York University, New York City, NY, USA"}]},{"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.65"},{"volume-title":"ASIACRYPT (3) (Lecture Notes in Computer Science)","author":"Agrawal Shashank","key":"e_1_3_2_1_2_1","unstructured":"Shashank Agrawal and Srinivasan Raghuraman . 2020. KVaC: Key-Value Commitments for Blockchains and Beyond . In ASIACRYPT (3) (Lecture Notes in Computer Science) , Vol. 12493 . Springer , 839--869. Shashank Agrawal and Srinivasan Raghuraman. 2020. KVaC: Key-Value Commitments for Blockchains and Beyond. In ASIACRYPT (3) (Lecture Notes in Computer Science), Vol. 12493. Springer, 839--869."},{"key":"e_1_3_2_1_3_1","first-page":"94","article-title":"Contour","volume":"11025","author":"Al-Bassam Mustafa","year":"2018","unstructured":"Mustafa Al-Bassam and Sarah Meiklejohn . 2018 . Contour : A Practical System for Binary Transparency. 11025 (2018), 94 -- 110 . Mustafa Al-Bassam and Sarah Meiklejohn. 2018. Contour: A Practical System for Binary Transparency. 11025 (2018), 94--110.","journal-title":"A Practical System for Binary Transparency."},{"volume-title":"EuroS&P","author":"Baldimtsi Foteini","key":"e_1_3_2_1_4_1","unstructured":"Foteini Baldimtsi , Jan Camenisch , Maria Dubovitskaya , Anna Lysyanskaya , Leonid Reyzin , Kai Samelin , and Sophia Yakoubov . 2017. Accumulators with Applications to Anonymity-Preserving Revocation . In EuroS&P . IEEE , 301--315. Foteini Baldimtsi, Jan Camenisch, Maria Dubovitskaya, Anna Lysyanskaya, Leonid Reyzin, Kai Samelin, and Sophia Yakoubov. 2017. Accumulators with Applications to Anonymity-Preserving Revocation. In EuroS&P. IEEE, 301--315."},{"key":"e_1_3_2_1_5_1","volume-title":"Adrian Perrig, Ralf Sasse, and Pawel Szalachowski.","author":"Basin David A.","year":"2014","unstructured":"David A. Basin , Cas J. F. Cremers , Tiffany Hyun-Jin Kim , Adrian Perrig, Ralf Sasse, and Pawel Szalachowski. 2014 . ARPKI : Attack Resilient Public-Key Infrastructure. In CCS. ACM , 382--393. David A. Basin, Cas J. F. Cremers, Tiffany Hyun-Jin Kim, Adrian Perrig, Ralf Sasse, and Pawel Szalachowski. 2014. ARPKI: Attack Resilient Public-Key Infrastructure. In CCS. ACM, 382--393."},{"volume-title":"CRYPTO (3) (Lecture Notes in Computer Science)","author":"Ben-Sasson Eli","key":"e_1_3_2_1_6_1","unstructured":"Eli Ben-Sasson , Iddo Bentov , Yinon Horesh , and Michael Riabzev . 2019. Scalable Zero Knowledgewith No Trusted Setup . In CRYPTO (3) (Lecture Notes in Computer Science) , Vol. 11694 . Springer , 701--732. Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2019. Scalable Zero Knowledgewith No Trusted Setup. In CRYPTO (3) (Lecture Notes in Computer Science), Vol. 11694. Springer, 701--732."},{"volume-title":"CRYPTO (2) (Lecture Notes in Computer Science)","author":"Ben-Sasson Eli","key":"e_1_3_2_1_7_1","unstructured":"Eli Ben-Sasson , Alessandro Chiesa , Eran Tromer , and Madars Virza . 2014. Scalable Zero Knowledge via Cycles of Elliptic Curves . In CRYPTO (2) (Lecture Notes in Computer Science) , Vol. 8617 . Springer , 276--294. Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, and Madars Virza. 2014. Scalable Zero Knowledge via Cycles of Elliptic Curves. In CRYPTO (2) (Lecture Notes in Computer Science), Vol. 8617. Springer, 276--294."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Nir Bitansky Ran Canetti Alessandro Chiesa and Eran Tromer. 2013. Recursive composition and bootstrapping for SNARKS and proof-carrying data. In STOC. ACM 111--120.  Nir Bitansky Ran Canetti Alessandro Chiesa and Eran Tromer. 2013. Recursive composition and bootstrapping for SNARKS and proof-carrying data. In STOC. ACM 111--120.","DOI":"10.1145\/2488608.2488623"},{"key":"e_1_3_2_1_10_1","volume-title":"Jack O'Connor, et al.","author":"Blum Josh","year":"2020","unstructured":"Josh Blum , Simon Booth , Oded Gal , Maxwell Krohn , Julia Len , Karan Lyons , Antonio Marcedone , Mike Maxim , Merry Ember Mou , Jack O'Connor, et al. 2020 . E2E Encryption for Zoom Meetings . Josh Blum, Simon Booth, Oded Gal, Maxwell Krohn, Julia Len, Karan Lyons, Antonio Marcedone, Mike Maxim, Merry Ember Mou, Jack O'Connor, et al. 2020. E2E Encryption for Zoom Meetings."},{"volume-title":"CRYPTO (1) (Lecture Notes in Computer Science)","author":"Boneh Dan","key":"e_1_3_2_1_11_1","unstructured":"Dan Boneh , Benedikt B\u00fcnz , and Ben Fisch . 2019. Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains . In CRYPTO (1) (Lecture Notes in Computer Science) , Vol. 11692 . Springer , 561--586. Dan Boneh, Benedikt B\u00fcnz, and Ben Fisch. 2019. Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains. In CRYPTO (1) (Lecture Notes in Computer Science), Vol. 11692. Springer, 561--586."},{"key":"e_1_3_2_1_12_1","volume-title":"Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments. In CRYPTO (1) (Lecture Notes in Computer Science)","author":"Boneh Dan","year":"2021","unstructured":"Dan Boneh , Justin Drake , Ben Fisch , and Ariel Gabizon . 2021 . Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments. In CRYPTO (1) (Lecture Notes in Computer Science) , Vol. 12825 . Springer , 649--680. Dan Boneh, Justin Drake, Ben Fisch, and Ariel Gabizon. 2021. Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments. In CRYPTO (1) (Lecture Notes in Computer Science), Vol. 12825. Springer, 649--680."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53357-4_7"},{"key":"e_1_3_2_1_14_1","volume-title":"ZEXE: Enabling Decentralized Private Computation. In IEEE Symposium on Security and Privacy. IEEE, 947--964","author":"Bowe Sean","year":"2020","unstructured":"Sean Bowe , Alessandro Chiesa , Matthew Green , Ian Miers , Pratyush Mishra , and Howard Wu . 2020 . ZEXE: Enabling Decentralized Private Computation. In IEEE Symposium on Security and Privacy. IEEE, 947--964 . Sean Bowe, Alessandro Chiesa, Matthew Green, Ian Miers, Pratyush Mishra, and Howard Wu. 2020. ZEXE: Enabling Decentralized Private Computation. In IEEE Symposium on Security and Privacy. IEEE, 947--964."},{"key":"e_1_3_2_1_15_1","volume-title":"Financial Cryptography Workshops (Lecture Notes in Computer Science)","volume":"10958","author":"Bowe Sean","unstructured":"Sean Bowe , Ariel Gabizon , and Matthew D. Green . 2018. A Multi-party Protocol for Constructing the Public Parameters of the Pinocchio zk-SNARK . In Financial Cryptography Workshops (Lecture Notes in Computer Science) , Vol. 10958 . Springer, 64--77. Sean Bowe, Ariel Gabizon, and Matthew D. Green. 2018. A Multi-party Protocol for Constructing the Public Parameters of the Pinocchio zk-SNARK. In Financial Cryptography Workshops (Lecture Notes in Computer Science), Vol. 10958. Springer, 64--77."},{"key":"e_1_3_2_1_16_1","first-page":"1050","article-title":"Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model","volume":"2017","author":"Bowe Sean","year":"2017","unstructured":"Sean Bowe , Ariel Gabizon , and Ian Miers . 2017 . Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model . IACR Cryptol. ePrint Arch. 2017 (2017), 1050 . Sean Bowe, Ariel Gabizon, and Ian Miers. 2017. Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model. IACR Cryptol. ePrint Arch. 2017 (2017), 1050.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_17_1","first-page":"1021","article-title":"Halo: Recursive Proof Composition without a Trusted Setup","volume":"2019","author":"Bowe Sean","year":"2019","unstructured":"Sean Bowe , Jack Grigg , and Daira Hopwood . 2019 . Halo: Recursive Proof Composition without a Trusted Setup . IACR Cryptol. ePrint Arch. 2019 (2019), 1021 . Sean Bowe, Jack Grigg, and Daira Hopwood. 2019. Halo: Recursive Proof Composition without a Trusted Setup. IACR Cryptol. ePrint Arch. 2019 (2019), 1021.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Benjamin Braun Ariel J. Feldman Zuocheng Ren Srinath T. V. Setty Andrew J. Blumberg and Michael Walfish. 2013. Verifying computations with state. In SOSP. ACM 341--357.  Benjamin Braun Ariel J. Feldman Zuocheng Ren Srinath T. V. Setty Andrew J. Blumberg and Michael Walfish. 2013. Verifying computations with state. In SOSP. ACM 341--357.","DOI":"10.1145\/2517349.2522733"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02351719"},{"volume-title":"TCC (2) (Lecture Notes in Computer Science)","author":"B\u00fcnz Benedikt","key":"e_1_3_2_1_20_1","unstructured":"Benedikt B\u00fcnz , Alessandro Chiesa , Pratyush Mishra , and Nicholas Spooner . 2020. Recursive Proof Composition from Accumulation Schemes . In TCC (2) (Lecture Notes in Computer Science) , Vol. 12551 . Springer , 1--18. Benedikt B\u00fcnz, Alessandro Chiesa, Pratyush Mishra, and Nicholas Spooner. 2020. Recursive Proof Composition from Accumulation Schemes. In TCC (2) (Lecture Notes in Computer Science), Vol. 12551. Springer, 1--18."},{"volume-title":"EUROCRYPT (1) (Lecture Notes in Computer Science)","author":"B\u00fcnz Benedikt","key":"e_1_3_2_1_21_1","unstructured":"Benedikt B\u00fcnz , Ben Fisch , and Alan Szepieniec . 2020. Transparent SNARKs from DARK Compilers . In EUROCRYPT (1) (Lecture Notes in Computer Science) , Vol. 12105 . Springer , 677--706. Benedikt B\u00fcnz, Ben Fisch, and Alan Szepieniec. 2020. Transparent SNARKs from DARK Compilers. In EUROCRYPT (1) (Lecture Notes in Computer Science), Vol. 12105. Springer, 677--706."},{"key":"e_1_3_2_1_22_1","volume-title":"FlyClient: Super-Light Clients for Cryptocurrencies. In IEEE Symposium on Security and Privacy. IEEE, 928--946","author":"B\u00fcnz Benedikt","year":"2020","unstructured":"Benedikt B\u00fcnz , Lucianna Kiffer , Loi Luu , and Mahdi Zamani . 2020 . FlyClient: Super-Light Clients for Cryptocurrencies. In IEEE Symposium on Security and Privacy. IEEE, 928--946 . Benedikt B\u00fcnz, Lucianna Kiffer, Loi Luu, and Mahdi Zamani. 2020. FlyClient: Super-Light Clients for Cryptocurrencies. In IEEE Symposium on Security and Privacy. IEEE, 928--946."},{"key":"e_1_3_2_1_23_1","unstructured":"Vitalik Buterin. [n.d.]. The Dawn of Hybrid Layer 2 Protocols. https:\/\/vitalik.ca\/ general\/2019\/08\/28\/hybrid_layer_2.html.  Vitalik Buterin. [n.d.]. The Dawn of Hybrid Layer 2 Protocols. https:\/\/vitalik.ca\/ general\/2019\/08\/28\/hybrid_layer_2.html."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Matteo Campanelli Dario Fiore Semin Han Jihye Kim Dimitris Kolonelos and Hyunok Oh. 2021. Succinct Zero-Knowledge Batch Proofs for Set Accumulators. IACR Cryptol. ePrint Arch. (2021) 1672.  Matteo Campanelli Dario Fiore Semin Han Jihye Kim Dimitris Kolonelos and Hyunok Oh. 2021. Succinct Zero-Knowledge Batch Proofs for Set Accumulators. IACR Cryptol. ePrint Arch. (2021) 1672.","DOI":"10.1145\/3548606.3560677"},{"volume-title":"Public Key Cryptography (Lecture Notes in Computer Science)","author":"Catalano Dario","key":"e_1_3_2_1_25_1","unstructured":"Dario Catalano and Dario Fiore . 2013. Vector Commitments and Their Applications . In Public Key Cryptography (Lecture Notes in Computer Science) , Vol. 7778 . Springer , 55--72. Dario Catalano and Dario Fiore. 2013. Vector Commitments and Their Applications. In Public Key Cryptography (Lecture Notes in Computer Science), Vol. 7778. Springer, 55--72."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Melissa Chase Apoorvaa Deshpande Esha Ghosh and Harjasleen Malvai. 2019. SEEMless: Secure End-to-End Encrypted Messaging with less Trust. In CCS. ACM 1639--1656.  Melissa Chase Apoorvaa Deshpande Esha Ghosh and Harjasleen Malvai. 2019. SEEMless: Secure End-to-End Encrypted Messaging with less Trust. In CCS. ACM 1639--1656.","DOI":"10.1145\/3319535.3363202"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00025"},{"key":"e_1_3_2_1_28_1","first-page":"1522","article-title":"Reducing Participation Costs via Incremental Verification for Ledger Systems","volume":"2020","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 . IACR Cryptol. ePrint Arch. 2020 (2020), 1522 . Weikeng Chen, Alessandro Chiesa, Emma Dauterman, and Nicholas P.Ward. 2020. Reducing Participation Costs via Incremental Verification for Ledger Systems. IACR Cryptol. ePrint Arch. 2020 (2020), 1522.","journal-title":"IACR Cryptol. ePrint Arch."},{"volume-title":"TGC (Lecture Notes in Computer Science)","author":"Cheval Vincent","key":"e_1_3_2_1_29_1","unstructured":"Vincent Cheval , St\u00e9phanie Delaune , and Mark Ryan . 2014. Tests for Establishing Security Properties . In TGC (Lecture Notes in Computer Science) , Vol. 8902 . Springer , 82--96. Vincent Cheval, St\u00e9phanie Delaune, and Mark Ryan. 2014. Tests for Establishing Security Properties. In TGC (Lecture Notes in Computer Science), Vol. 8902. Springer, 82--96."},{"key":"e_1_3_2_1_30_1","volume-title":"Ward","author":"Chiesa Alessandro","year":"2020","unstructured":"Alessandro Chiesa , Yuncong Hu , Mary Maller , Pratyush Mishra , Noah Vesely , and Nicholas P . Ward . 2020 . Marlin : Preprocessing zkSNARKs with Universal and Updatable SRS. In EUROCRYPT (1) (Lecture Notes in Computer Science), Vol. 12105 . Springer , 738--768. Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely, and Nicholas P.Ward. 2020. Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. In EUROCRYPT (1) (Lecture Notes in Computer Science), Vol. 12105. Springer, 738--768."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Arka Rai Choudhuri Matthew Green Abhishek Jain Gabriel Kaptchuk and Ian Miers. 2017. Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards. In CCS. ACM 719--728.  Arka Rai Choudhuri Matthew Green Abhishek Jain Gabriel Kaptchuk and Ian Miers. 2017. Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards. In CCS. ACM 719--728.","DOI":"10.1145\/3133956.3134092"},{"key":"e_1_3_2_1_32_1","unstructured":"Cloudflare. 2020. Merkle Town.  Cloudflare. 2020. Merkle Town."},{"key":"e_1_3_2_1_33_1","volume-title":"Riposte: An Anonymous Messaging System Handling Millions of Users. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 321--338","author":"Corrigan-Gibbs Henry","year":"2015","unstructured":"Henry Corrigan-Gibbs , Dan Boneh , and David Mazi\u00e8res . 2015 . Riposte: An Anonymous Messaging System Handling Millions of Users. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 321--338 . Henry Corrigan-Gibbs, Dan Boneh, and David Mazi\u00e8res. 2015. Riposte: An Anonymous Messaging System Handling Millions of Users. In IEEE Symposium on Security and Privacy. IEEE Computer Society, 321--338."},{"volume-title":"Efficient Data Structures For Tamper- Evident Logging. In USENIX Security Symposium. USENIX Association, 317--334","author":"Scott","key":"e_1_3_2_1_34_1","unstructured":"Scott A. Crosby and Dan S. Wallach. 2009 . Efficient Data Structures For Tamper- Evident Logging. In USENIX Security Symposium. USENIX Association, 317--334 . Scott A. Crosby and Dan S. Wallach. 2009. Efficient Data Structures For Tamper- Evident Logging. In USENIX Security Symposium. USENIX Association, 317--334."},{"key":"e_1_3_2_1_35_1","volume-title":"An Empirical Study of Textual Key-Fingerprint Representations. In USENIX Security Symposium. USENIX Association, 193--208","author":"Dechand Sergej","year":"2016","unstructured":"Sergej Dechand , Dominik Sch\u00fcrmann , Karoline Busse , Yasemin Acar , Sascha Fahl , and Matthew Smith . 2016 . An Empirical Study of Textual Key-Fingerprint Representations. In USENIX Security Symposium. USENIX Association, 193--208 . Sergej Dechand, Dominik Sch\u00fcrmann, Karoline Busse, Yasemin Acar, Sascha Fahl, and Matthew Smith. 2016. An Empirical Study of Textual Key-Fingerprint Representations. In USENIX Security Symposium. USENIX Association, 193--208."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0052"},{"volume-title":"Hey","author":"Fahl Sascha","key":"e_1_3_2_1_37_1","unstructured":"Sascha Fahl , Sergej Dechand , Henning Perl , Felix Fischer , Jaromir Smrcek , and Matthew Smith . 2014. Hey , NSA : Stay Away from my Market! Future Proofing App Markets against Powerful Attackers. In CCS. ACM , 1143--1155. Sascha Fahl, Sergej Dechand, Henning Perl, Felix Fischer, Jaromir Smrcek, and Matthew Smith. 2014. Hey, NSA: Stay Away from my Market! Future Proofing App Markets against Powerful Attackers. In CCS. ACM, 1143--1155."},{"key":"e_1_3_2_1_38_1","first-page":"953","article-title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge","volume":"2019","author":"Gabizon Ariel","year":"2019","unstructured":"Ariel Gabizon , Zachary J. Williamson , and Oana Ciobotaru . 2019 . PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge . IACR Cryptol. ePrint Arch. 2019 (2019), 953 . Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru. 2019. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. IACR Cryptol. ePrint Arch. 2019 (2019), 953.","journal-title":"IACR Cryptol. ePrint Arch."},{"volume-title":"EUROCRYPT (Lecture Notes in Computer Science)","author":"Gennaro Rosario","key":"e_1_3_2_1_39_1","unstructured":"Rosario Gennaro , Craig Gentry , Bryan Parno , and Mariana Raykova . 2013. Quadratic Span Programs and Succinct NIZKs without PCPs . In EUROCRYPT (Lecture Notes in Computer Science) , Vol. 7881 . Springer , 626--645. Rosario Gennaro, Craig Gentry, Bryan Parno, and Mariana Raykova. 2013. Quadratic Span Programs and Succinct NIZKs without PCPs. In EUROCRYPT (Lecture Notes in Computer Science), Vol. 7881. Springer, 626--645."},{"key":"e_1_3_2_1_40_1","first-page":"458","article-title":"Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems","volume":"2019","author":"Grassi Lorenzo","year":"2019","unstructured":"Lorenzo Grassi , Daniel Kales , Dmitry Khovratovich , Arnab Roy , Christian Rechberger , and Markus Schofnegger . 2019 . Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems . IACR Cryptol. ePrint Arch. 2019 (2019), 458 . Lorenzo Grassi, Daniel Kales, Dmitry Khovratovich, Arnab Roy, Christian Rechberger, and Markus Schofnegger. 2019. Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems. IACR Cryptol. ePrint Arch. 2019 (2019), 458.","journal-title":"IACR Cryptol. ePrint Arch."},{"volume-title":"ASIACRYPT (Lecture Notes in Computer Science)","author":"Groth Jens","key":"e_1_3_2_1_41_1","unstructured":"Jens Groth . 2010. Short Pairing-Based Non-interactive Zero-Knowledge Arguments . In ASIACRYPT (Lecture Notes in Computer Science) , Vol. 6477 . Springer , 321--340. Jens Groth. 2010. Short Pairing-Based Non-interactive Zero-Knowledge Arguments. In ASIACRYPT (Lecture Notes in Computer Science), Vol. 6477. Springer, 321--340."},{"volume-title":"EUROCRYPT (2) (Lecture Notes in Computer Science)","author":"Groth Jens","key":"e_1_3_2_1_42_1","unstructured":"Jens Groth . 2016. On the Size of Pairing-Based Non-interactive Arguments . In EUROCRYPT (2) (Lecture Notes in Computer Science) , Vol. 9666 . Springer , 305--326. Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT (2) (Lecture Notes in Computer Science), Vol. 9666. Springer, 305--326."},{"key":"e_1_3_2_1_43_1","volume-title":"IEEE Symposium on Security and Privacy. IEEE Computer Society.","author":"Hu Yuncong","year":"2021","unstructured":"Yuncong Hu , Kian Hooshmand , Harika Kalidhindi , Seung Jin Yang , and Raluca Ada Popa . 2021 . Merkle 2: A Low-Latency Transparency Log System . In IEEE Symposium on Security and Privacy. IEEE Computer Society. Yuncong Hu, Kian Hooshmand, Harika Kalidhindi, Seung Jin Yang, and Raluca Ada Popa. 2021. Merkle 2: A Low-Latency Transparency Log System. In IEEE Symposium on Security and Privacy. IEEE Computer Society."},{"volume-title":"WWW. International World Wide Web Conferences Steering Committee \/ ACM, 679--690","author":"Hyun-Jin Kim Tiffany","key":"e_1_3_2_1_44_1","unstructured":"Tiffany Hyun-Jin Kim , Lin-Shung Huang , Adrian Perrig , Collin Jackson , and Virgil D. Gligor . 2013. Accountable key infrastructure (AKI): a proposal for a public-key validation infrastructure . In WWW. International World Wide Web Conferences Steering Committee \/ ACM, 679--690 . Tiffany Hyun-Jin Kim, Lin-Shung Huang, Adrian Perrig, Collin Jackson, and Virgil D. Gligor. 2013. Accountable key infrastructure (AKI): a proposal for a public-key validation infrastructure. In WWW. International World Wide Web Conferences Steering Committee \/ ACM, 679--690."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00018"},{"key":"e_1_3_2_1_46_1","volume-title":"Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. IACR Cryptol. ePrint Arch.","author":"Kothapalli Abhiram","year":"2021","unstructured":"Abhiram Kothapalli , Srinath Setty , and Ioanna Tzialla . 2021 . Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. IACR Cryptol. ePrint Arch. (2021), 370. Abhiram Kothapalli, Srinath Setty, and Ioanna Tzialla. 2021. Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. IACR Cryptol. ePrint Arch. (2021), 370."},{"key":"e_1_3_2_1_47_1","volume-title":"Lai and Giulio Malavolta","author":"Russell W.","year":"2019","unstructured":"Russell W. F. Lai and Giulio Malavolta . 2019 . Subvector Commitments with Application to Succinct Arguments. In CRYPTO (1) (Lecture Notes in Computer Science), Vol. 11692 . Springer , 530--560. Russell W. F. Lai and Giulio Malavolta. 2019. Subvector Commitments with Application to Succinct Arguments. In CRYPTO (1) (Lecture Notes in Computer Science), Vol. 11692. Springer, 530--560."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2659897"},{"key":"e_1_3_2_1_49_1","first-page":"1","article-title":"Certificate Transparency","volume":"6962","author":"Laurie Ben","year":"2013","unstructured":"Ben Laurie , Adam Langley , and Emilia K\u00e4sper . 2013 . Certificate Transparency . RFC 6962 (2013), 1 -- 27 . Ben Laurie, Adam Langley, and Emilia K\u00e4sper. 2013. Certificate Transparency. RFC 6962 (2013), 1--27.","journal-title":"RFC"},{"volume-title":"IEEE Symposium on Security and Privacy. IEEE, 119--134","author":"Lee Jonathan","key":"e_1_3_2_1_50_1","unstructured":"Jonathan Lee , Kirill Nikitin , and Srinath T. V. Setty . 2020. Replicated state machines without replicated execution . In IEEE Symposium on Security and Privacy. IEEE, 119--134 . Jonathan Lee, Kirill Nikitin, and Srinath T. V. Setty. 2020. Replicated state machines without replicated execution. In IEEE Symposium on Security and Privacy. IEEE, 119--134."},{"key":"e_1_3_2_1_51_1","first-page":"975","article-title":"Aardvark: A Concurrent Authenticated Dictionary with Short Proofs","volume":"2020","author":"Leung Derek","year":"2020","unstructured":"Derek Leung , Yossi Gilad , Sergey Gorbunov , Leonid Reyzin , and Nickolai Zeldovich . 2020 . Aardvark: A Concurrent Authenticated Dictionary with Short Proofs . IACR Cryptol. ePrint Arch. 2020 (2020), 975 . Derek Leung, Yossi Gilad, Sergey Gorbunov, Leonid Reyzin, and Nickolai Zeldovich. 2020. Aardvark: A Concurrent Authenticated Dictionary with Short Proofs. IACR Cryptol. ePrint Arch. 2020 (2020), 975.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_52_1","volume-title":"Shasha","author":"Li Jinyuan","year":"2004","unstructured":"Jinyuan Li , Maxwell N. Krohn , David Mazi\u00e8res , and Dennis E . Shasha . 2004 . Secure Untrusted Data Repository (SUNDR). In OSDI. USENIX Association , 121--136. Jinyuan Li, Maxwell N. Krohn, David Mazi\u00e8res, and Dennis E. Shasha. 2004. Secure Untrusted Data Repository (SUNDR). In OSDI. USENIX Association, 121--136."},{"key":"e_1_3_2_1_53_1","volume-title":"Secure History Preservation Through Timeline Entanglement. In USENIX Security Symposium. USENIX, 297--312","author":"Maniatis Petros","year":"2002","unstructured":"Petros Maniatis and Mary Baker . 2002 . Secure History Preservation Through Timeline Entanglement. In USENIX Security Symposium. USENIX, 297--312 . Petros Maniatis and Mary Baker. 2002. Secure History Preservation Through Timeline Entanglement. In USENIX Security Symposium. USENIX, 297--312."},{"key":"e_1_3_2_1_54_1","volume-title":"Think Global","author":"Meiklejohn Sarah","year":"2011","unstructured":"Sarah Meiklejohn , Pavel Kalinnikov , Cindy S. Lin , Martin Hutchinson , Gary Belvin , Mariana Raykova , and Al Cutter . 2020. Think Global , Act Local : Gossip and Client Audits in Verifiable Data Structures. CoRR abs\/ 2011 .04551 (2020). Sarah Meiklejohn, Pavel Kalinnikov, Cindy S. Lin, Martin Hutchinson, Gary Belvin, Mariana Raykova, and Al Cutter. 2020. Think Global, Act Local: Gossip and Client Audits in Verifiable Data Structures. CoRR abs\/2011.04551 (2020)."},{"key":"e_1_3_2_1_55_1","volume-title":"Freedman","author":"Melara Marcela S.","year":"2015","unstructured":"Marcela S. Melara , Aaron Blankstein , Joseph Bonneau , Edward W. Felten , and Michael J . Freedman . 2015 . CONIKS : Bringing Key Transparency to End Users. In USENIX Security Symposium. USENIX Association , 383--398. Marcela S. Melara, Aaron Blankstein, Joseph Bonneau, Edward W. Felten, and Michael J. Freedman. 2015. CONIKS: Bringing Key Transparency to End Users. In USENIX Security Symposium. USENIX Association, 383--398."},{"volume-title":"CRYPTO (Lecture Notes in Computer Science)","author":"Merkle Ralph C.","key":"e_1_3_2_1_56_1","unstructured":"Ralph C. Merkle . 1987. A Digital Signature Based on a Conventional Encryption Function . In CRYPTO (Lecture Notes in Computer Science) , Vol. 293 . Springer , 369--378. Ralph C. Merkle. 1987. A Digital Signature Based on a Conventional Encryption Function. In CRYPTO (Lecture Notes in Computer Science), Vol. 293. Springer, 369--378."},{"key":"e_1_3_2_1_57_1","volume-title":"USENIX Security Symposium. USENIX Association, 1271--1287","author":"Nikitin Kirill","year":"2017","unstructured":"Kirill Nikitin , Eleftherios Kokoris-Kogias , Philipp Jovanovic , Nicolas Gailly , Linus Gasser , Ismail Khoffi , Justin Cappos , and Bryan Ford . 2017 . CHAINIAC: Proactive Software-Update Transparency via Collectively Signed Skipchains and Verified Builds . In USENIX Security Symposium. USENIX Association, 1271--1287 . Kirill Nikitin, Eleftherios Kokoris-Kogias, Philipp Jovanovic, Nicolas Gailly, Linus Gasser, Ismail Khoffi, Justin Cappos, and Bryan Ford. 2017. CHAINIAC: Proactive Software-Update Transparency via Collectively Signed Skipchains and Verified Builds. In USENIX Security Symposium. USENIX Association, 1271--1287."},{"key":"e_1_3_2_1_58_1","series-title":"Lecture Notes in Computer Science","volume-title":"The Design of Dynamic Data Structures","author":"Overmars Mark H.","unstructured":"Mark H. Overmars . 1983. The Design of Dynamic Data Structures . Lecture Notes in Computer Science , Vol. 156 . Springer . Mark H. Overmars. 1983. The Design of Dynamic Data Structures. Lecture Notes in Computer Science, Vol. 156. Springer."},{"key":"e_1_3_2_1_59_1","volume-title":"Scaling Verifiable Computation Using Efficient Set Accumulators. In USENIX Security Symposium. USENIX Association","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 Symposium. 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 Symposium. USENIX Association, 2075--2092."},{"key":"e_1_3_2_1_60_1","volume-title":"Balloon: A Forward-Secure Append-Only Persistent Authenticated Data Structure. In ESORICS (2) (Lecture Notes in Computer Science)","author":"Pulls Tobias","year":"2015","unstructured":"Tobias Pulls and Roel Peeters . 2015 . Balloon: A Forward-Secure Append-Only Persistent Authenticated Data Structure. In ESORICS (2) (Lecture Notes in Computer Science) , Vol. 9327 . Springer , 622--641. Tobias Pulls and Roel Peeters. 2015. Balloon: A Forward-Secure Append-Only Persistent Authenticated Data Structure. In ESORICS (2) (Lecture Notes in Computer Science), Vol. 9327. Springer, 622--641."},{"volume-title":"Enhanced Certificate Transparency and End-to-End Encrypted Mail","author":"Ryan Mark Dermot","key":"e_1_3_2_1_61_1","unstructured":"Mark Dermot Ryan . 2014. Enhanced Certificate Transparency and End-to-End Encrypted Mail . In NDSS. The Internet Society . Mark Dermot Ryan. 2014. Enhanced Certificate Transparency and End-to-End Encrypted Mail. In NDSS. The Internet Society."},{"key":"e_1_3_2_1_62_1","volume-title":"Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup. In CRYPTO (3) (Lecture Notes in Computer Science)","author":"Setty Srinath","year":"2020","unstructured":"Srinath Setty . 2020 . Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup. In CRYPTO (3) (Lecture Notes in Computer Science) , Vol. 12172 . Springer , 704--737. Srinath Setty. 2020. Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup. In CRYPTO (3) (Lecture Notes in Computer Science), Vol. 12172. Springer, 704--737."},{"volume-title":"Proving the correct execution of concurrent services in zero-knowledge","author":"Setty Srinath T. V.","key":"e_1_3_2_1_63_1","unstructured":"Srinath T. V. Setty , Sebastian Angel , Trinabh Gupta , and Jonathan Lee . 2018. Proving the correct execution of concurrent services in zero-knowledge . In OSDI. USENIX Association , 339--356. Srinath T. V. Setty, Sebastian Angel, Trinabh Gupta, and Jonathan Lee. 2018. Proving the correct execution of concurrent services in zero-knowledge. In OSDI. USENIX Association, 339--356."},{"key":"e_1_3_2_1_64_1","volume-title":"Layer 2 Blockchain Scaling: a Survey. CoRR abs\/2107.10881","author":"Sguanci Cosimo","year":"2021","unstructured":"Cosimo Sguanci , Roberto Spatafora , and Andrea Mario Vergani . 2021. Layer 2 Blockchain Scaling: a Survey. CoRR abs\/2107.10881 ( 2021 ). Cosimo Sguanci, Roberto Spatafora, and Andrea Mario Vergani. 2021. Layer 2 Blockchain Scaling: a Survey. CoRR abs\/2107.10881 (2021)."},{"key":"e_1_3_2_1_65_1","volume-title":"A Fast Large-Integer Extended GCD Algorithm and Hardware Design for Verifiable Delay Functions and Modular Inversion. IACR Cryptology ePrint Archive 2021\/1292","author":"Sreedhar Kavya","year":"2021","unstructured":"Kavya Sreedhar , Mark Horowitz , and Christopher Torng . 2021. A Fast Large-Integer Extended GCD Algorithm and Hardware Design for Verifiable Delay Functions and Modular Inversion. IACR Cryptology ePrint Archive 2021\/1292 ( 2021 ). https:\/\/eprint.iacr.org\/2021\/1292 Kavya Sreedhar, Mark Horowitz, and Christopher Torng. 2021. A Fast Large-Integer Extended GCD Algorithm and Hardware Design for Verifiable Delay Functions and Modular Inversion. IACR Cryptology ePrint Archive 2021\/1292 (2021). https:\/\/eprint.iacr.org\/2021\/1292"},{"volume-title":"Number of apps available in leading app stores as of 1st quarter","year":"2022","key":"e_1_3_2_1_66_1","unstructured":"Statista. 2022. Number of apps available in leading app stores as of 1st quarter 2022 . https:\/\/www.statista.com\/statistics\/276623\/number-of-apps-available-inleading-app-stores\/ Statista. 2022. Number of apps available in leading app stores as of 1st quarter 2022. https:\/\/www.statista.com\/statistics\/276623\/number-of-apps-available-inleading-app-stores\/"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.38"},{"key":"e_1_3_2_1_68_1","volume-title":"Jeremy Thomas, and Blase Ur.","author":"Tan Joshua","year":"2017","unstructured":"Joshua Tan , Lujo Bauer , Joseph Bonneau , Lorrie Faith Cranor , Jeremy Thomas, and Blase Ur. 2017 . Can Unicorns Help Users Compare Crypto Key Fingerprints?. In CHI. ACM , 3787--3798. Joshua Tan, Lujo Bauer, Joseph Bonneau, Lorrie Faith Cranor, Jeremy Thomas, and Blase Ur. 2017. Can Unicorns Help Users Compare Crypto Key Fingerprints?. In CHI. ACM, 3787--3798."},{"key":"e_1_3_2_1_69_1","unstructured":"TechCrunch. 2021. Signal's Brian Acton talks about exploding growth monetization and WhatsApp data-sharing outrage. https: \/\/techcrunch.com\/2021\/01\/12\/signal-brian-acton-talks-about-explodinggrowth-monetization-and-whatsapp-data-sharing-outrage\/  TechCrunch. 2021. Signal's Brian Acton talks about exploding growth monetization and WhatsApp data-sharing outrage. https: \/\/techcrunch.com\/2021\/01\/12\/signal-brian-acton-talks-about-explodinggrowth-monetization-and-whatsapp-data-sharing-outrage\/"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"crossref","unstructured":"Alin Tomescu Vivek Bhupatiraju Dimitrios Papadopoulos Charalampos Papamanthou Nikos Triandopoulos and Srinivas Devadas. 2019. Transparency Logs via Append-Only Authenticated Dictionaries. In CCS. ACM 1299--1316.  Alin Tomescu Vivek Bhupatiraju Dimitrios Papadopoulos Charalampos Papamanthou Nikos Triandopoulos and Srinivas Devadas. 2019. Transparency Logs via Append-Only Authenticated Dictionaries. In CCS. ACM 1299--1316.","DOI":"10.1145\/3319535.3345652"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.19"},{"key":"e_1_3_2_1_72_1","first-page":"1239","article-title":"Authenticated Dictionaries with Cross-Incremental Proof (Dis)aggregation","volume":"2020","author":"Tomescu Alin","year":"2020","unstructured":"Alin Tomescu , Yu Xia , and Zachary Newman . 2020 . Authenticated Dictionaries with Cross-Incremental Proof (Dis)aggregation . IACR Cryptol. ePrint Arch. 2020 (2020), 1239 . Alin Tomescu, Yu Xia, and Zachary Newman. 2020. Authenticated Dictionaries with Cross-Incremental Proof (Dis)aggregation. IACR Cryptol. ePrint Arch. 2020 (2020), 1239.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_73_1","unstructured":"Nirvan Tyagi Ben Fisch Andrew Zitek Joseph Bonneau and Stefano Tessaro. 2021. VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries. IACR Cryptol. ePrint Arch. (2021) 627.  Nirvan Tyagi Ben Fisch Andrew Zitek Joseph Bonneau and Stefano Tessaro. 2021. VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries. IACR Cryptol. ePrint Arch. (2021) 627."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"crossref","unstructured":"Ioanna Tzialla Abhiram Kothapalli Bryan Parno and Srinath Setty. 2021. Transparency Dictionaries with Succinct Proofs of Correct Operation. IACR Cryptol. ePrint Arch. (2021) 1263.  Ioanna Tzialla Abhiram Kothapalli Bryan Parno and Srinath Setty. 2021. Transparency Dictionaries with Succinct Proofs of Correct Operation. IACR Cryptol. ePrint Arch. (2021) 1263.","DOI":"10.14722\/ndss.2022.23143"},{"volume-title":"TCC (Lecture Notes in Computer Science)","author":"Valiant Paul","key":"e_1_3_2_1_75_1","unstructured":"Paul Valiant . 2008. Incrementally Verifiable Computation or Proofs of Knowledge Imply Time\/Space Efficiency . In TCC (Lecture Notes in Computer Science) , Vol. 4948 . Springer , 1--18. Paul Valiant. 2008. Incrementally Verifiable Computation or Proofs of Knowledge Imply Time\/Space Efficiency. In TCC (Lecture Notes in Computer Science), Vol. 4948. Springer, 1--18."},{"volume-title":"Alice? A Usability Study of the Authentication Ceremony of Secure Messaging Applications","author":"Vaziripour Elham","key":"e_1_3_2_1_76_1","unstructured":"Elham Vaziripour , Justin Wu , Mark O'Neill , Jordan Whitehead , Scott Heidbrink , Kent E. Seamons , and Daniel Zappala . 2017. Is that you , Alice? A Usability Study of the Authentication Ceremony of Secure Messaging Applications . In SOUPS. USENIX Association , 29--47. Elham Vaziripour, Justin Wu, Mark O'Neill, Jordan Whitehead, Scott Heidbrink, Kent E. Seamons, and Daniel Zappala. 2017. Is that you, Alice? A Usability Study of the Authentication Ceremony of Secure Messaging Applications. In SOUPS. USENIX Association, 29--47."},{"volume-title":"EUROCRYPT (Lecture Notes in Computer Science)","author":"Wesolowski Benjamin","key":"e_1_3_2_1_77_1","unstructured":"Benjamin Wesolowski . 2019. Efficient Verifiable Delay Functions . In EUROCRYPT (Lecture Notes in Computer Science) , Vol. 11478 . Springer , 379--407. Benjamin Wesolowski. 2019. Efficient Verifiable Delay Functions. In EUROCRYPT (Lecture Notes in Computer Science), Vol. 11478. Springer, 379--407."},{"key":"e_1_3_2_1_78_1","unstructured":"Barry Whitehat Alex Gluchowski Harry R Yondon Fu and Philippe Castonguay. Roll up \/ roll back snark. https:\/\/ethresear.ch\/t\/roll-up-roll-back-snarkside- chain-17000-tps\/.  Barry Whitehat Alex Gluchowski Harry R Yondon Fu and Philippe Castonguay. Roll up \/ roll back snark. https:\/\/ethresear.ch\/t\/roll-up-roll-back-snarkside- chain-17000-tps\/."},{"key":"e_1_3_2_1_79_1","volume-title":"DIZK: A Distributed Zero Knowledge Proof System. In USENIX Security Symposium. USENIX Association, 675--692","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. In USENIX Security Symposium. USENIX Association, 675--692 . Howard Wu, Wenting Zheng, Alessandro Chiesa, Raluca Ada Popa, and Ion Stoica. 2018. DIZK: A Distributed Zero Knowledge Proof System. In USENIX Security Symposium. USENIX Association, 675--692."},{"key":"e_1_3_2_1_80_1","first-page":"486","article-title":"How to detect unauthorised usage of a key","volume":"2015","author":"Yu Jiangshan","year":"2015","unstructured":"Jiangshan Yu , Mark Ryan , and Cas Cremers . 2015 . How to detect unauthorised usage of a key . IACR Cryptol. ePrint Arch. 2015 (2015), 486 . Jiangshan Yu, Mark Ryan, and Cas Cremers. 2015. How to detect unauthorised usage of a key. IACR Cryptol. ePrint Arch. 2015 (2015), 486.","journal-title":"IACR Cryptol. ePrint Arch."},{"volume-title":"PipeZK: Accelerating Zero-Knowledge Proof with a Pipelined Architecture","author":"Zhang Ye","key":"e_1_3_2_1_81_1","unstructured":"Ye Zhang , Shuo Wang , Xian Zhang , Jiangbin Dong , Xingzhong Mao , Fan Long , Cong Wang , Dong Zhou , Mingyu Gao , and Guangyu Sun . 2021. PipeZK: Accelerating Zero-Knowledge Proof with a Pipelined Architecture . In ISCA. IEEE , 416--428. Ye Zhang, Shuo Wang, Xian Zhang, Jiangbin Dong, Xingzhong Mao, Fan Long, Cong Wang, Dong Zhou, Mingyu Gao, and Guangyu Sun. 2021. PipeZK: Accelerating Zero-Knowledge Proof with a Pipelined Architecture. In ISCA. IEEE, 416--428."}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Los Angeles CA USA","acronym":"CCS '22"},"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.3560605","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560605","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:58Z","timestamp":1750182538000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560605"}},"subtitle":["Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":80,"alternative-id":["10.1145\/3548606.3560605","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560605","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"}}]}}