{"author":[{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"}],"date_updated":"2021-01-12T08:13:26Z","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7407","year":"2018","quality_controlled":"1","doi":"10.4230/LIPICS.ITCS.2019.59","alternative_title":["LIPIcs"],"license":"https://creativecommons.org/licenses/by/4.0/","publication_status":"published","scopus_import":1,"main_file_link":[{"url":"https://eprint.iacr.org/2018/194","open_access":"1"}],"volume":124,"ddc":["000"],"citation":{"ista":"Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124, 59:1-59:25.","mla":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” <i>10th Innovations in Theoretical Computer Science  Conference (ITCS 2019)</i>, vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:<a href=\"https://doi.org/10.4230/LIPICS.ITCS.2019.59\">10.4230/LIPICS.ITCS.2019.59</a>.","chicago":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In <i>10th Innovations in Theoretical Computer Science  Conference (ITCS 2019)</i>, 124:59:1-59:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.ITCS.2019.59\">https://doi.org/10.4230/LIPICS.ITCS.2019.59</a>.","ama":"Pietrzak KZ. Proofs of catalytic space. In: <i>10th Innovations in Theoretical Computer Science  Conference (ITCS 2019)</i>. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:59:1-59:25. doi:<a href=\"https://doi.org/10.4230/LIPICS.ITCS.2019.59\">10.4230/LIPICS.ITCS.2019.59</a>","apa":"Pietrzak, K. Z. (2018). Proofs of catalytic space. In <i>10th Innovations in Theoretical Computer Science  Conference (ITCS 2019)</i> (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ITCS.2019.59\">https://doi.org/10.4230/LIPICS.ITCS.2019.59</a>","ieee":"K. Z. Pietrzak, “Proofs of catalytic space,” in <i>10th Innovations in Theoretical Computer Science  Conference (ITCS 2019)</i>, San Diego, CA, United States, 2018, vol. 124, p. 59:1-59:25.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25."},"publication":"10th Innovations in Theoretical Computer Science  Conference (ITCS 2019)","month":"12","status":"public","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-095-8"]},"file_date_updated":"2020-07-14T12:47:57Z","language":[{"iso":"eng"}],"date_created":"2020-01-30T09:16:05Z","title":"Proofs of catalytic space","article_processing_charge":"No","page":"59:1-59:25","day":"31","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"intvolume":"       124","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"conference","file":[{"date_created":"2020-02-04T08:17:52Z","file_size":822884,"date_updated":"2020-07-14T12:47:57Z","checksum":"5cebb7f7849a3beda898f697d755dd96","creator":"dernst","relation":"main_file","file_name":"2018_LIPIcs_Pietrzak.pdf","content_type":"application/pdf","file_id":"7443","access_level":"open_access"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}],"abstract":[{"lang":"eng","text":"Proofs of space (PoS) [Dziembowski et al., CRYPTO'15] are proof systems where a prover can convince a verifier that he \"wastes\" disk space. PoS were introduced as a more ecological and economical replacement for proofs of work which are currently used to secure blockchains like Bitcoin. In this work we investigate extensions of PoS which allow the prover to embed useful data into the dedicated space, which later can be recovered. Our first contribution is a security proof for the original PoS from CRYPTO'15 in the random oracle model (the original proof only applied to a restricted class of adversaries which can store a subset of the data an honest prover would store). When this PoS is instantiated with recent constructions of maximally depth robust graphs, our proof implies basically optimal security. As a second contribution we show three different extensions of this PoS where useful data can be embedded into the space required by the prover. Our security proof for the PoS extends (non-trivially) to these constructions. We discuss how some of these variants can be used as proofs of catalytic space (PoCS), a notion we put forward in this work, and which basically is a PoS where most of the space required by the prover can be used to backup useful data. Finally we discuss how one of the extensions is a candidate construction for a proof of replication (PoR), a proof system recently suggested in the Filecoin whitepaper. "}],"ec_funded":1,"oa":1,"oa_version":"Published Version","date_published":"2018-12-31T00:00:00Z","conference":{"location":"San Diego, CA, United States","end_date":"2019-01-12","start_date":"2019-01-10","name":"ITCS: Innovations in theoretical Computer Science Conference"}}