{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T20:34:45Z","timestamp":1773434085453,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T00:00:00Z","timestamp":1638403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Research Council of Norway - Credence","award":["288126"],"award-info":[{"award-number":["288126"]}]},{"name":"Research Council of Norway - BBChain","award":["274451"],"award-info":[{"award-number":["274451"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,12,6]]},"DOI":"10.1145\/3464298.3493397","type":"proceedings-article","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T23:39:52Z","timestamp":1638488392000},"page":"236-247","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Snarl"],"prefix":"10.1145","author":[{"given":"Racin","family":"Nygaard","sequence":"first","affiliation":[{"name":"University of Stavanger, Stavanger, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vero","family":"Estrada-Gali\u00f1anes","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hein","family":"Meling","sequence":"additional","affiliation":[{"name":"University of Stavanger, Stavanger, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Bee nodes live. https:\/\/beenodes.live\/. Accessed: 2021-06-01.  Bee nodes live. https:\/\/beenodes.live\/. Accessed: 2021-06-01."},{"key":"e_1_3_2_1_2_1","volume-title":"P2P File System. arXiv preprint arXiv:1407.3561","author":"Benet Juan","year":"2014","unstructured":"Juan Benet . IPFS- Content Addressed , Versioned , P2P File System. arXiv preprint arXiv:1407.3561 , 2014 . Juan Benet. IPFS-Content Addressed, Versioned, P2P File System. arXiv preprint arXiv:1407.3561, 2014."},{"issue":"2","key":"e_1_3_2_1_3_1","first-page":"225","volume":"12","author":"Blum Manuel","year":"1994","unstructured":"Manuel Blum , Will Evans , Peter Gemmell , Sampath Kannan , and Moni Naor. Checking the Correctness of Memories. Algorithmica , 12 ( 2 ): 225 -- 244 , 1994 . Manuel Blum, Will Evans, Peter Gemmell, Sampath Kannan, and Moni Naor. Checking the Correctness of Memories. Algorithmica, 12(2):225--244, 1994.","journal-title":"Moni Naor. Checking the Correctness of Memories. Algorithmica"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Scott Chacon and Ben Straub. Pro Git chapter Git internals - Git objects. Number 10.2. Apress 2 edition 2014.  Scott Chacon and Ben Straub. Pro Git chapter Git internals - Git objects. Number 10.2. Apress 2 edition 2014.","DOI":"10.1007\/978-1-4842-0076-6"},{"key":"e_1_3_2_1_5_1","volume-title":"Incentives Build Robustness in BitTorrent. https:\/\/www.bittorrent.org\/bittorrentecon.pdf","author":"Cohen Bram","year":"2003","unstructured":"Bram Cohen . Incentives Build Robustness in BitTorrent. https:\/\/www.bittorrent.org\/bittorrentecon.pdf , 2003 . Accessed : 2021-10-26. Bram Cohen. Incentives Build Robustness in BitTorrent. https:\/\/www.bittorrent.org\/bittorrentecon.pdf, 2003. Accessed: 2021-10-26."},{"key":"e_1_3_2_1_6_1","volume-title":"IPFS and Friends: A Qualitative Comparison of Next Generation Peer-to-Peer Data Networks","author":"Daniel Erik","year":"2021","unstructured":"Erik Daniel and Florian Tschorsch . IPFS and Friends: A Qualitative Comparison of Next Generation Peer-to-Peer Data Networks . 2021 . Erik Daniel and Florian Tschorsch. IPFS and Friends: A Qualitative Comparison of Next Generation Peer-to-Peer Data Networks. 2021."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2018.00030"},{"key":"e_1_3_2_1_8_1","first-page":"1","volume-title":"Pascal Felber. Simple Data Entanglement Layouts With High Reliability. In 2016 IEEE 35th International Performance Computing and Communications Conference (IPCCC)","author":"Estrada-Galinanes Vero","year":"2016","unstructured":"Vero Estrada-Galinanes , Jehan-Fran\u00e7ois P\u00e2ris , and Pascal Felber. Simple Data Entanglement Layouts With High Reliability. In 2016 IEEE 35th International Performance Computing and Communications Conference (IPCCC) , pages 1 -- 8 . IEEE, 2016 . Vero Estrada-Galinanes, Jehan-Fran\u00e7ois P\u00e2ris, and Pascal Felber. Simple Data Entanglement Layouts With High Reliability. In 2016 IEEE 35th International Performance Computing and Communications Conference (IPCCC), pages 1--8. IEEE, 2016."},{"key":"e_1_3_2_1_9_1","first-page":"1","volume-title":"Replicated Erasure Codes for Storage and Repair-Traffic Efficiency. In 14-th IEEE International Conference on Peer-to-Peer Computing","author":"Friedman Roy","year":"2014","unstructured":"Roy Friedman , Yoav Kantor , and Amir Kantor . Replicated Erasure Codes for Storage and Repair-Traffic Efficiency. In 14-th IEEE International Conference on Peer-to-Peer Computing , pages 1 -- 10 . IEEE , 2014 . Roy Friedman, Yoav Kantor, and Amir Kantor. Replicated Erasure Codes for Storage and Repair-Traffic Efficiency. In 14-th IEEE International Conference on Peer-to-Peer Computing, pages 1--10. IEEE, 2014."},{"key":"e_1_3_2_1_10_1","first-page":"131","volume-title":"NDSS","volume":"3","author":"Goh Eu-Jin","year":"2003","unstructured":"Eu-Jin Goh , Hovav Shacham , Nagendra Modadugu , and Dan Boneh . SiRiUS : Securing Remote Untrusted Storage . In NDSS , volume 3 , pages 131 -- 145 . Citeseer , 2003 . Eu-Jin Goh, Hovav Shacham, Nagendra Modadugu, and Dan Boneh. SiRiUS: Securing Remote Untrusted Storage. In NDSS, volume 3, pages 131--145. Citeseer, 2003."},{"key":"e_1_3_2_1_11_1","unstructured":"Helm. The package manager for Kubernetes. https:\/\/helm.sh\/.  Helm. The package manager for Kubernetes. https:\/\/helm.sh\/."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73545-8_25"},{"key":"e_1_3_2_1_13_1","unstructured":"Kubernetes. Production-Grade Container Orchestration. https:\/\/kubernetes.io\/.  Kubernetes. Production-Grade Container Orchestration. https:\/\/kubernetes.io\/."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/PTP.2004.1334935"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251229.1251239"},{"key":"e_1_3_2_1_16_1","volume-title":"David SH Rosenthal, and Mary Baker. The LOCKSS peer-to-peer digital preservation system. ACM Transactions on Computer Systems (TOCS), 23(1):2--50","author":"Maniatis Petros","year":"2005","unstructured":"Petros Maniatis , Mema Roussopoulos , Thomas J Giuli , David SH Rosenthal, and Mary Baker. The LOCKSS peer-to-peer digital preservation system. ACM Transactions on Computer Systems (TOCS), 23(1):2--50 , 2005 . Petros Maniatis, Mema Roussopoulos, Thomas J Giuli, David SH Rosenthal, and Mary Baker. The LOCKSS peer-to-peer digital preservation system. ACM Transactions on Computer Systems (TOCS), 23(1):2--50, 2005."},{"key":"e_1_3_2_1_17_1","first-page":"53","volume-title":"Maymounkov and David Mazieres. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In International Workshop on Peer-to-Peer Systems","author":"Petar","year":"2002","unstructured":"Petar Maymounkov and David Mazieres. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In International Workshop on Peer-to-Peer Systems , pages 53 -- 65 . Springer , 2002 . Petar Maymounkov and David Mazieres. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In International Workshop on Peer-to-Peer Systems, pages 53--65. Springer, 2002."},{"key":"e_1_3_2_1_18_1","first-page":"369","volume-title":"Conference on the theory and application of cryptographic techniques","author":"Merkle Ralph C","year":"1987","unstructured":"Ralph C Merkle . A Digital Signature Based on a Conventional Encryption Function . In Conference on the theory and application of cryptographic techniques , pages 369 -- 378 . Springer , 1987 . Ralph C Merkle. A Digital Signature Based on a Conventional Encryption Function. In Conference on the theory and application of cryptographic techniques, pages 369--378. Springer, 1987."},{"key":"e_1_3_2_1_19_1","volume-title":"Bitcoin: A Peer-to-Peer Electronic Cash System","author":"Satoshi Nakamoto","year":"2008","unstructured":"Satoshi Nakamoto et al. Bitcoin: A Peer-to-Peer Electronic Cash System . 2008 . Satoshi Nakamoto et al. Bitcoin: A Peer-to-Peer Electronic Cash System. 2008."},{"key":"e_1_3_2_1_20_1","first-page":"1","volume-title":"FAST","volume":"3","author":"Rhea Sean C","year":"2003","unstructured":"Sean C Rhea , Patrick R Eaton , Dennis Geels , Hakim Weatherspoon , Ben Y Zhao , and John Kubiatowicz . Pond : The OceanStore Prototype . In FAST , volume 3 , pages 1 -- 14 , 2003 . Sean C Rhea, Patrick R Eaton, Dennis Geels, Hakim Weatherspoon, Ben Y Zhao, and John Kubiatowicz. Pond: The OceanStore Prototype. In FAST, volume 3, pages 1--14, 2003."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11558989_21"},{"key":"e_1_3_2_1_22_1","volume-title":"Understanding Disk Failure Rates: What Does an MTTF of 1,000,000 Hours Mean to You? ACM Transactions on Storage (TOS), 3(3):8--es","author":"Schroeder Bianca","year":"2007","unstructured":"Bianca Schroeder and Garth A Gibson . Understanding Disk Failure Rates: What Does an MTTF of 1,000,000 Hours Mean to You? ACM Transactions on Storage (TOS), 3(3):8--es , 2007 . Bianca Schroeder and Garth A Gibson. Understanding Disk Failure Rates: What Does an MTTF of 1,000,000 Hours Mean to You? ACM Transactions on Storage (TOS), 3(3):8--es, 2007."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.80"},{"key":"e_1_3_2_1_24_1","first-page":"17","volume-title":"Selimi and Felix Freitag. Tahoe-LAFS Distributed Storage Service in Community Network Clouds. In 2014 IEEE Fourth International Conference on Big Data and Cloud Computing","author":"Mennan","year":"2014","unstructured":"Mennan Selimi and Felix Freitag. Tahoe-LAFS Distributed Storage Service in Community Network Clouds. In 2014 IEEE Fourth International Conference on Big Data and Cloud Computing , pages 17 -- 24 . IEEE, 2014 . Mennan Selimi and Felix Freitag. Tahoe-LAFS Distributed Storage Service in Community Network Clouds. In 2014 IEEE Fourth International Conference on Big Data and Cloud Computing, pages 17--24. IEEE, 2014."},{"key":"e_1_3_2_1_25_1","first-page":"26","volume-title":"Erez Zadok. Ensuring Data Integrity in Storage: Techniques and Applications. In Proceedings of the 2005 ACM workshop on Storage security and survivability","author":"Sivathanu Gopalan","year":"2005","unstructured":"Gopalan Sivathanu , Charles P Wright , and Erez Zadok. Ensuring Data Integrity in Storage: Techniques and Applications. In Proceedings of the 2005 ACM workshop on Storage security and survivability , pages 26 -- 36 , 2005 . Gopalan Sivathanu, Charles P Wright, and Erez Zadok. Ensuring Data Integrity in Storage: Techniques and Applications. In Proceedings of the 2005 ACM workshop on Storage security and survivability, pages 26--36, 2005."},{"key":"e_1_3_2_1_26_1","volume-title":"swear and swindle: incentive system for swarm, may","author":"Tr\u00f3n V","year":"2016","unstructured":"V Tr\u00f3n , A Fischer , DA Nagy , Z Felf\u00f6ldi , and N Johnson . Swap , swear and swindle: incentive system for swarm, may 2016 . V Tr\u00f3n, A Fischer, DA Nagy, Z Felf\u00f6ldi, and N Johnson. Swap, swear and swindle: incentive system for swarm, may 2016."},{"key":"e_1_3_2_1_27_1","volume-title":"The Book of Swarm - v1.0 pre-release 7","author":"Tr\u00f3n Viktor","year":"2020","unstructured":"Viktor Tr\u00f3n . The Book of Swarm - v1.0 pre-release 7 November 17, 2020 . https:\/\/www.ethswarm.org\/The-Book-of-Swarm.pdf. Accessed : 2021-10-26. Viktor Tr\u00f3n. The Book of Swarm - v1.0 pre-release 7 November 17, 2020. https:\/\/www.ethswarm.org\/The-Book-of-Swarm.pdf. Accessed: 2021-10-26."},{"key":"e_1_3_2_1_28_1","unstructured":"Viktor Tr\u00f3n et al. Swarm documentation - release 0.5. https:\/\/swarm-guide.readthedocs.io. Accessed: 2021-05-25.  Viktor Tr\u00f3n et al. Swarm documentation - release 0.5. https:\/\/swarm-guide.readthedocs.io. Accessed: 2021-05-25."},{"key":"e_1_3_2_1_29_1","first-page":"328","volume-title":"Replication: A Quantitative Comparison. In International Workshop on Peer-to-Peer Systems","author":"Weatherspoon Hakim","year":"2002","unstructured":"Hakim Weatherspoon and John D Kubiatowicz . Erasure Coding vs . Replication: A Quantitative Comparison. In International Workshop on Peer-to-Peer Systems , pages 328 -- 337 . Springer , 2002 . Hakim Weatherspoon and John D Kubiatowicz. Erasure Coding vs. Replication: A Quantitative Comparison. In International Workshop on Peer-to-Peer Systems, pages 328--337. Springer, 2002."},{"key":"e_1_3_2_1_30_1","volume-title":"Length extension attack --- Wikipedia, the free encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Length_extension_attack&oldid=934998209","author":"Wikipedia","year":"2020","unstructured":"Wikipedia contributors. Length extension attack --- Wikipedia, the free encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Length_extension_attack&oldid=934998209 , 2020 . [Online; accessed 26-October-2021]. Wikipedia contributors. Length extension attack --- Wikipedia, the free encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Length_extension_attack&oldid=934998209, 2020. [Online; accessed 26-October-2021]."},{"key":"e_1_3_2_1_31_1","unstructured":"Zooko Wilcox-O'Hearn. [tahoe-dev] erasure coding makes files more fragile not less. https:\/\/tahoe-lafs.org\/pipermail\/tahoe-dev\/2012-March\/007185.html. Accessed: 26.10.2021.  Zooko Wilcox-O'Hearn. [tahoe-dev] erasure coding makes files more fragile not less. https:\/\/tahoe-lafs.org\/pipermail\/tahoe-dev\/2012-March\/007185.html. Accessed: 26.10.2021."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1456469.1456474"},{"key":"e_1_3_2_1_33_1","volume-title":"Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper, 151(2014):1--32","author":"Gavin Wood","year":"2014","unstructured":"Gavin Wood et al. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper, 151(2014):1--32 , 2014 . Gavin Wood et al. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper, 151(2014):1--32, 2014."},{"key":"e_1_3_2_1_34_1","first-page":"114","volume-title":"Pramod Viswanath. Coded Merkle Tree: Solving Data Availability Attacks in Blockchains. In International Conference on Financial Cryptography and Data Security","author":"Yu Mingchao","year":"2020","unstructured":"Mingchao Yu , Saeid Sahraei , Songze Li , Salman Avestimehr , Sreeram Kannan , and Pramod Viswanath. Coded Merkle Tree: Solving Data Availability Attacks in Blockchains. In International Conference on Financial Cryptography and Data Security , pages 114 -- 134 . Springer , 2020 . Mingchao Yu, Saeid Sahraei, Songze Li, Salman Avestimehr, Sreeram Kannan, and Pramod Viswanath. Coded Merkle Tree: Solving Data Availability Attacks in Blockchains. In International Conference on Financial Cryptography and Data Security, pages 114--134. Springer, 2020."}],"event":{"name":"Middleware '21: 22nd International Middleware Conference","location":"Qu\u00e9bec city Canada","acronym":"Middleware '21","sponsor":["ACM Association for Computing Machinery","USENIX Assoc USENIX Assoc","IFIP"]},"container-title":["Proceedings of the 22nd International Middleware Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3464298.3493397","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3464298.3493397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:16Z","timestamp":1750191136000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3464298.3493397"}},"subtitle":["entangled merkle trees for improved file availability and storage utilization"],"short-title":[],"issued":{"date-parts":[[2021,12,2]]},"references-count":34,"alternative-id":["10.1145\/3464298.3493397","10.1145\/3464298"],"URL":"https:\/\/doi.org\/10.1145\/3464298.3493397","relation":{},"subject":[],"published":{"date-parts":[[2021,12,2]]},"assertion":[{"value":"2021-12-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}