{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:00:41Z","timestamp":1783576841823,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-11-C-0028"],"award-info":[{"award-number":["FA9550-11-C-0028"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF16-1-0145"],"award-info":[{"award-number":["W911NF16-1-0145"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1330599, CNS-1514163, CNS-1564102, CNS-1704615"],"award-info":[{"award-number":["CNS-1330599, CNS-1514163, CNS-1564102, CNS-1704615"]}],"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":[[2019,11,6]]},"DOI":"10.1145\/3319535.3354231","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"1351-1367","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["PIEs"],"prefix":"10.1145","author":[{"given":"Ethan","family":"Cecchetti","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben","family":"Fisch","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ian","family":"Miers","sequence":"additional","affiliation":[{"name":"Cornell Tech, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ari","family":"Juels","sequence":"additional","affiliation":[{"name":"Jacobs Institute, Cornell Tech, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Fraud Proofs: Maximising Light Client Security and Scaling Blockchains with Dishonest Majorities. https:\/\/arxiv.org\/abs\/1809.09044.","author":"Al-Bassam Mustafa","year":"2018"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134031"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_1"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3196534"},{"key":"e_1_3_2_2_5_1","volume-title":"Security and Cryptography for Networks (SCN)","author":"Ateniese Giuseppe"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315318"},{"key":"e_1_3_2_2_7_1","volume-title":"Conference on Computer and Communications Security (CCS). ACM, 863--874","author":"Backes Michael"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046677"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"e_1_3_2_2_11_1","volume-title":"Advances in Cryptology (ASIACRYPT)","author":"Boneh Dan"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046766"},{"key":"e_1_3_2_2_13_1","volume-title":"The Stateless Client Concept. https:\/\/ethresear.ch\/t\/the-stateless-client-concept\/172. (Oct. 24","author":"Buterin Vitalik","year":"2017"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2013.03.003"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Bram Cohen and Krzysztof Pietrzak. 2018a. Simple Proofs of Sequential Work. In EUROCRYPT. 451--467.  Bram Cohen and Krzysztof Pietrzak. 2018a. Simple Proofs of Sequential Work. In EUROCRYPT. 451--467.","DOI":"10.1007\/978-3-319-78375-8_15"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_15"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.68"},{"key":"e_1_3_2_2_18_1","unstructured":"William James Dally and Brian Patrick Towles. 2004. Principles and Practices of Interconnection Networks 1 ed.). Chapter 4.  William James Dally and Brian Patrick Towles. 2004. Principles and Practices of Interconnection Networks 1 ed.). Chapter 4."},{"key":"e_1_3_2_2_19_1","volume-title":"Proofs of Replicated Storage Without Timing Assumptions. https:\/\/ia.cr\/2018\/654. IACR Cryptology ePrint Archive (July","author":"Damgrard Ivan","year":"2018"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_8"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_29"},{"key":"e_1_3_2_2_23_1","volume-title":"Ethereum Full Node Sync Default Chart. https:\/\/etherscan.io\/chartsync\/chaindefault. Accessed","year":"2019"},{"key":"e_1_3_2_2_24_1","volume-title":"The Skein hash function family. Submission to NIST (round 3)","author":"Ferguson Niels","year":"2010"},{"key":"e_1_3_2_2_25_1","volume-title":"PoReps: Proofs of Space on Useful Data. https:\/\/ia.cr\/2018\/678. IACR Cryptology ePrint Archive (July","author":"Fisch Ben","year":"2018"},{"key":"e_1_3_2_2_26_1","volume-title":"Tight Proofs of Space and Replication. https:\/\/ia.cr\/2018\/702. IACR Cryptology ePrint Archive (Aug","author":"Fisch Ben","year":"2018"},{"key":"e_1_3_2_2_27_1","unstructured":"Ben Fisch Joseph Bonneau Juan Benet and Nicola Greco. 2018a. Proof of Replication using Depth Robust Graphs. Talk at Blockchain Protocol Analysis and Security Engineering (BPASE) conference.  Ben Fisch Joseph Bonneau Juan Benet and Nicola Greco. 2018a. Proof of Replication using Depth Robust Graphs. Talk at Blockchain Protocol Analysis and Security Engineering (BPASE) conference."},{"key":"e_1_3_2_2_29_1","volume-title":"Financial Cryptography and Data Security (FC)","author":"Goldschlag David M"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315317"},{"key":"e_1_3_2_2_31_1","volume-title":"Financial Cryptography and Data Security (FC)","author":"Kamara Seny"},{"key":"e_1_3_2_2_32_1","volume-title":"A random zoo: sloth, unicorn, and trx. https:\/\/ia.cr\/2015\/366. IACR Cryptology ePrint Archive (April","author":"Lenstra Arjen K","year":"2015"},{"key":"e_1_3_2_2_33_1","volume-title":"Proof of unique blockchain storage. https:\/\/bitslog.wordpress.com\/2014\/11\/03\/proof-of-local-blockchain-storage\/. Accessed","author":"Lerner Sergio Demian","year":"2019"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Mohammad Mahmoody Tal Moran and Salil Vadhan. 2013. Publicly verifiable proofs of sequential work. In Innovations in Theoretical Computer Science (ITCS). ACM 373--388.  Mohammad Mahmoody Tal Moran and Salil Vadhan. 2013. Publicly verifiable proofs of sequential work. In Innovations in Theoretical Computer Science (ITCS). ACM 373--388.","DOI":"10.1145\/2422436.2422479"},{"key":"e_1_3_2_2_35_1","volume-title":"LIPIcs-Leibniz International Proceedings in Informatics","volume":"91","author":"Pass Rafael","year":"2017"},{"key":"e_1_3_2_2_37_1","volume-title":"Proofs of Catalytic Space. https:\/\/ia.cr\/2018\/194. IACR Cryptology ePrint Archive (Feb","author":"Pietrzak Krzysztof","year":"2018"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055817"},{"key":"e_1_3_2_2_39_1","volume-title":"Filecoin: A Decentralized Storage Network. https:\/\/filecoin.io\/filecoin.pdf. (July 19","author":"Labs Protocol","year":"2017"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_11"},{"key":"e_1_3_2_2_41_1","unstructured":"Ronald L Rivest Adi Shamir and David A Wagner. 1996. Time-lock puzzles and timed-release crypto. (1996).  Ronald L Rivest Adi Shamir and David A Wagner. 1996. Time-lock puzzles and timed-release crypto. (1996)."},{"key":"e_1_3_2_2_42_1","volume-title":"EE Times (Sept. 14","author":"Rizzatti Lauro","year":"2016"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90113-X"},{"key":"e_1_3_2_2_44_1","volume-title":"Foundations of Computer Science (FOCS)","author":"Schnitger Georg"},{"key":"e_1_3_2_2_45_1","volume-title":"Advances in Cryptology (ASIACRYPT)","author":"Shacham Hovav"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3152481"},{"key":"e_1_3_2_2_47_1","volume-title":"Storj: A Decentralized Cloud Storage Network Framework. https:\/\/storj.io\/storjv3.pdf. Accessed","author":"Inc. Storj Labs.","year":"2018"},{"key":"e_1_3_2_2_48_1","unstructured":"Jason Teutsch and Christian Reitwie\u00dfner. 2017. A scalable verification solution for blockchains. https:\/\/people.cs.uchicago.edu\/ teutsch\/papers\/truebit.pdf. (2017).  Jason Teutsch and Christian Reitwie\u00dfner. 2017. A scalable verification solution for blockchains. https:\/\/people.cs.uchicago.edu\/ teutsch\/papers\/truebit.pdf. (2017)."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/800116.803752"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382227"},{"key":"e_1_3_2_2_51_1","volume-title":"Sia: Simple Decentralized Storage. https:\/\/sia.tech\/sia.pdf. Accessed","author":"Vorick David","year":"2014"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354231","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354231","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:24:03Z","timestamp":1750202643000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354231"}},"subtitle":["Public Incompressible Encodings for Decentralized Storage"],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":47,"alternative-id":["10.1145\/3319535.3354231","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3354231","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}