{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T01:11:00Z","timestamp":1780708260119,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,9,19]]},"DOI":"10.1145\/3558535.3559778","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:54:17Z","timestamp":1688568857000},"page":"180-197","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Information Dispersal with Provable Retrievability for Rollups"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7447-9857","authenticated-orcid":false,"given":"Kamilla","family":"Nazirkhanova","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9777-6168","authenticated-orcid":false,"given":"Joachim","family":"Neu","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1460-5900","authenticated-orcid":false,"given":"David","family":"Tse","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Financial Cryptography (2) (Lecture Notes in Computer Science","author":"Al-Bassam Mustafa","unstructured":"Mustafa Al-Bassam , Alberto Sonnino , Vitalik Buterin , and Ismail Khoffi . 2021. Fraud and Data Availability Proofs: Detecting Invalid Blocks in Light Clients . In Financial Cryptography (2) (Lecture Notes in Computer Science , Vol. 12675). Springer, 279-- 298 . Mustafa Al-Bassam, Alberto Sonnino, Vitalik Buterin, and Ismail Khoffi. 2021. Fraud and Data Availability Proofs: Detecting Invalid Blocks in Light Clients. In Financial Cryptography (2) (Lecture Notes in Computer Science, Vol. 12675). Springer, 279--298."},{"key":"e_1_3_2_1_2_1","unstructured":"arkworks contributors. 2022. arkworks zkSNARK ecosystem. https:\/\/arkworks.rs  arkworks contributors. 2022. arkworks zkSNARK ecosystem. https:\/\/arkworks.rs"},{"key":"e_1_3_2_1_3_1","volume-title":"Prism: Deconstructing the Blockchain to Approach Physical Limits. In CCS. ACM, 585--602.","author":"Bagaria Vivek Kumar","year":"2019","unstructured":"Vivek Kumar Bagaria , Sreeram Kannan , David Tse , Giulia Fanti , and Pramod Viswanath . 2019 . Prism: Deconstructing the Blockchain to Approach Physical Limits. In CCS. ACM, 585--602. Vivek Kumar Bagaria, Sreeram Kannan, David Tse, Giulia Fanti, and Pramod Viswanath. 2019. Prism: Deconstructing the Blockchain to Approach Physical Limits. In CCS. ACM, 585--602."},{"key":"e_1_3_2_1_4_1","volume-title":"SCN (Lecture Notes in Computer Science","volume":"267","author":"Barreto Paulo S. L. M.","year":"2002","unstructured":"Paulo S. L. M. Barreto , Ben Lynn , and Michael Scott . 2002 . Constructing Elliptic Curves with Prescribed Embedding Degrees . In SCN (Lecture Notes in Computer Science , Vol. 2576). Springer, 257-- 267 . Paulo S. L. M. Barreto, Ben Lynn, and Michael Scott. 2002. Constructing Elliptic Curves with Prescribed Embedding Degrees. In SCN (Lecture Notes in Computer Science, Vol. 2576). Springer, 257--267."},{"key":"e_1_3_2_1_5_1","unstructured":"Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. 2018. Scalable transparent and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. (2018) 46.  Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. 2018. Scalable transparent and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. (2018) 46."},{"key":"e_1_3_2_1_6_1","unstructured":"Sean Bowe. 2017. BLS12-381: New zk-SNARK Elliptic Curve Construction. https:\/\/electriccoin.co\/blog\/new-snark-curve\/  Sean Bowe. 2017. BLS12-381: New zk-SNARK Elliptic Curve Construction. https:\/\/electriccoin.co\/blog\/new-snark-curve\/"},{"key":"e_1_3_2_1_7_1","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) 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) 1050."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Kevin D. Bowers Ari Juels and Alina Oprea. 2009. Proofs of retrievability: theory and implementation. In CCSW. ACM 43--54.  Kevin D. Bowers Ari Juels and Alina Oprea. 2009. Proofs of retrievability: theory and implementation. In CCSW. ACM 43--54.","DOI":"10.1145\/1655008.1655015"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_42"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"George Danezis Lefteris Kokoris-Kogias Alberto Sonnino and Alexander Spiegelman. 2022. Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus. In EuroSys. ACM 34--50.  George Danezis Lefteris Kokoris-Kogias Alberto Sonnino and Alexander Spiegelman. 2022. Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus. In EuroSys. ACM 34--50.","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21741-3_1"},{"key":"e_1_3_2_1_13_1","unstructured":"Dankrad Feist and Dmitry Khovratovich. 2020. Fast Amortized Kate Proofs. https:\/\/github.com\/khovratovich\/Kate\/blob\/master\/Kate_amortized.pdf  Dankrad Feist and Dmitry Khovratovich. 2020. Fast Amortized Kate Proofs. https:\/\/github.com\/khovratovich\/Kate\/blob\/master\/Kate_amortized.pdf"},{"key":"e_1_3_2_1_14_1","volume-title":"EUROCRYPT (2) (Lecture Notes in Computer Science","author":"Fisch Ben","unstructured":"Ben Fisch . 2019. Tight Proofs of Space and Replication . In EUROCRYPT (2) (Lecture Notes in Computer Science , Vol. 11477). Springer, 324-- 348 . Ben Fisch. 2019. Tight Proofs of Space and Replication. In EUROCRYPT (2) (Lecture Notes in Computer Science, Vol. 11477). Springer, 324--348."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_1_16_1","unstructured":"Alex Gluchowski. 2020. zkRollup vs. Validium. https:\/\/medium.com\/matterlabs\/zkrollup-vs-validium-starkex-5614e38bc263  Alex Gluchowski. 2020. zkRollup vs. Validium. https:\/\/medium.com\/matterlabs\/zkrollup-vs-validium-starkex-5614e38bc263"},{"key":"e_1_3_2_1_17_1","unstructured":"Guy Goren Lefteris Kokoris-Kogias Alberto Sonnino Shir Cohen and Alexander Spiegelman. 2022. Proof of Availability & Retrieval in a Modular Blockchain Architecture. IACR Cryptol. ePrint Arch. (2022) 455.  Guy Goren Lefteris Kokoris-Kogias Alberto Sonnino Shir Cohen and Alexander Spiegelman. 2022. Proof of Availability & Retrieval in a Modular Blockchain Architecture. IACR Cryptol. ePrint Arch. (2022) 455."},{"key":"e_1_3_2_1_18_1","volume-title":"Reiter","author":"Hendricks James","year":"2007","unstructured":"James Hendricks , Gregory R. Ganger , and Michael K . Reiter . 2007 . Verifying distributed erasure-coded data. In PODC. ACM , 139--146. James Hendricks, Gregory R. Ganger, and Michael K. Reiter. 2007. Verifying distributed erasure-coded data. In PODC. ACM, 139--146."},{"key":"e_1_3_2_1_19_1","volume-title":"Felten","author":"Kalodner Harry A.","year":"2018","unstructured":"Harry A. Kalodner , Steven Goldfeder , Xiaoqi Chen , S. Matthew Weinberg , and Edward W . Felten . 2018 . Arbitrum : Scalable, private smart contracts. In USENIX Security Symposium. USENIX Association , 1353--1370. Harry A. Kalodner, Steven Goldfeder, Xiaoqi Chen, S. Matthew Weinberg, and Edward W. Felten. 2018. Arbitrum: Scalable, private smart contracts. In USENIX Security Symposium. USENIX Association, 1353--1370."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_21_1","volume-title":"Introduction to Modern Cryptography","author":"Katz Jonathan","unstructured":"Jonathan Katz and Yehuda Lindell . 2014. Introduction to Modern Cryptography , Second Edition. CRC Press . Jonathan Katz and Yehuda Lindell. 2014. Introduction to Modern Cryptography, Second Edition. CRC Press."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.000-5"},{"key":"e_1_3_2_1_23_1","volume-title":"Sreeram Kannan, and Pramod Viswanath.","author":"Li Songze","year":"2020","unstructured":"Songze Li , Mingchao Yu , Chien-Sheng Yang , Amir Salman Avestimehr , Sreeram Kannan, and Pramod Viswanath. 2020 . PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously. In ISIT. IEEE , 203--208. Songze Li, Mingchao Yu, Chien-Sheng Yang, Amir Salman Avestimehr, Sreeram Kannan, and Pramod Viswanath. 2020. PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously. In ISIT. IEEE, 203--208."},{"key":"e_1_3_2_1_24_1","unstructured":"Yuan Lu Zhenliang Lu Qiang Tang and Guiling Wang. 2020. Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement Revisited. In PODC. ACM 129--138.  Yuan Lu Zhenliang Lu Qiang Tang and Guiling Wang. 2020. Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement Revisited. In PODC. ACM 129--138."},{"key":"e_1_3_2_1_25_1","unstructured":"Patrick McCorry Chris Buckland Bennet Yee and Dawn Song. 2021. SoK: Validating Bridges as a Scaling Solution for Blockchains. IACR Cryptol. ePrint Arch. (2021) 1589.  Patrick McCorry Chris Buckland Bennet Yee and Dawn Song. 2021. SoK: Validating Bridges as a Scaling Solution for Blockchains. IACR Cryptol. ePrint Arch. (2021) 1589."},{"key":"e_1_3_2_1_26_1","volume-title":"CRYPTO (Lecture Notes in Computer Science","volume":"378","author":"Merkle Ralph C.","year":"1987","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_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_30"},{"key":"e_1_3_2_1_28_1","volume-title":"Concentrated Stopping Set Design for Coded Merkle Tree: Improving Security Against Data Availability Attacks in Blockchain Systems","author":"Mitra Debarnab","unstructured":"Debarnab Mitra , Lev Tauz , and Lara Dolecek . 2020. Concentrated Stopping Set Design for Coded Merkle Tree: Improving Security Against Data Availability Attacks in Blockchain Systems . In ITW. IEEE , 1--5. Debarnab Mitra, Lev Tauz, and Lara Dolecek. 2020. Concentrated Stopping Set Design for Coded Merkle Tree: Improving Security Against Data Availability Attacks in Blockchain Systems. In ITW. IEEE, 1--5."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3194138"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_31_1","volume-title":"Financial Cryptography (2) (Lecture Notes in Computer Science","author":"Sheng Peiyao","unstructured":"Peiyao Sheng , Bowen Xue , Sreeram Kannan , and Pramod Viswanath . 2021. ACeD: Scalable Data Availability Oracle . In Financial Cryptography (2) (Lecture Notes in Computer Science , Vol. 12675). Springer, 299-- 318 . Peiyao Sheng, Bowen Xue, Sreeram Kannan, and Pramod Viswanath. 2021. ACeD: Scalable Data Availability Oracle. In Financial Cryptography (2) (Lecture Notes in Computer Science, Vol. 12675). Springer, 299--318."},{"key":"e_1_3_2_1_32_1","unstructured":"Alin Tomescu. 2020. How to compute all Pointproofs. IACR Cryptol. ePrint Arch. (2020) 1516.  Alin Tomescu. 2020. How to compute all Pointproofs. IACR Cryptol. ePrint Arch. (2020) 1516."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_3"},{"key":"e_1_3_2_1_34_1","volume-title":"Mohammad Alizadeh, Sreeram Kannan, and David Tse.","author":"Yang Lei","year":"2022","unstructured":"Lei Yang , Seo Jin Park , Mohammad Alizadeh, Sreeram Kannan, and David Tse. 2022 . DispersedLedger: High- Throughput Byzantine Consensus on Variable Bandwidth Networks . (2022), 493--512. Lei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan, and David Tse. 2022. DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. (2022), 493--512."},{"key":"e_1_3_2_1_35_1","volume-title":"OHIE: Blockchain Scaling Made Simple. In IEEE Symposium on Security and Privacy. IEEE, 90--105","author":"Yu Haifeng","year":"2020","unstructured":"Haifeng Yu , Ivica Nikolic , Ruomu Hou , and Prateek Saxena . 2020 . OHIE: Blockchain Scaling Made Simple. In IEEE Symposium on Security and Privacy. IEEE, 90--105 . Haifeng Yu, Ivica Nikolic, Ruomu Hou, and Prateek Saxena. 2020. OHIE: Blockchain Scaling Made Simple. In IEEE Symposium on Security and Privacy. IEEE, 90--105."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51280-4_8"}],"event":{"name":"AFT '22: 4th ACM Conference on Advances in Financial Technologies","location":"Cambridge MA USA","acronym":"AFT '22"},"container-title":["Proceedings of the 4th ACM Conference on Advances in Financial Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558535.3559778","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558535.3559778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:09Z","timestamp":1750178829000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558535.3559778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,19]]},"references-count":36,"alternative-id":["10.1145\/3558535.3559778","10.1145\/3558535"],"URL":"https:\/\/doi.org\/10.1145\/3558535.3559778","relation":{},"subject":[],"published":{"date-parts":[[2022,9,19]]},"assertion":[{"value":"2023-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}