{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,30]],"date-time":"2026-10-30T18:32:43Z","timestamp":1793385163346,"version":"4.5.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319108780","type":"print"},{"value":"9783319108797","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10879-7_31","type":"book-chapter","created":{"date-parts":[[2014,8,21]],"date-time":"2014-08-21T01:19:04Z","timestamp":1408583944000},"page":"538-557","source":"Crossref","is-referenced-by-count":75,"title":["Proofs of Space: When Space Is of the Essence"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Ateniese","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ilario","family":"Bonacina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio","family":"Faonio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicola","family":"Galesi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"31_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/1064340.1064341","volume":"5","author":"M. Abadi","year":"2005","unstructured":"Abadi, M., Burrows, M., Manasse, M., Wobber, T.: Moderately hard, memory-bound functions. ACM Trans. Internet Technol.\u00a05(2), 299\u2013327 (2005)","journal-title":"ACM Trans. Internet Technol."},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Abliz, M., Znati, T.: A guided tour puzzle for denial of service prevention. In: ACSAC, pp. 279\u2013288. IEEE Computer Society (2009)","DOI":"10.1109\/ACSAC.2009.33"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Bonacina, I., Faonio, A., Galesi, N.: Proofs of space: When space is of the essence. Cryptology ePrint Archive, Report 2013\/805 (2013), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-319-10879-7_31"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1145\/1315245.1315318","volume-title":"Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS 2007","author":"G. Ateniese","year":"2007","unstructured":"Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS 2007, pp. 598\u2013609. ACM, New York (2007)"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-10366-7_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"G. Ateniese","year":"2009","unstructured":"Ateniese, G., Kamara, S., Katz, J.: Proofs of storage from homomorphic identification protocols. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 319\u2013333. Springer, Heidelberg (2009)"},{"key":"31_CR6","unstructured":"Back, A.: Hashcash - a denial of service counter-measure. Technical report (2002)"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. In: IEEE Conference on Computational Complexity, pp. 194\u2013203. IEEE Computer Society (2002)","DOI":"10.1109\/CCC.2002.1004355"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R.B. Boppana","year":"1987","unstructured":"Boppana, R.B., Hastad, J., Zachos, S.: Does co-np have short interactive proofs? Inf. Process. Lett.\u00a025(2), 127\u2013132 (1987)","journal-title":"Inf. Process. Lett."},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","year":"2005","unstructured":"Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.): ICALP 2005. LNCS, vol.\u00a03580. Springer, Heidelberg (2005)"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ic.2013.03.003","volume":"226","author":"R. Canetti","year":"2013","unstructured":"Canetti, R., Riva, B., Rothblum, G.N.: Refereed delegation of computation. Information and Computation\u00a0226, 16\u201336 (2013)","journal-title":"Information and Computation"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-14623-7_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"K.-M. Chung","year":"2010","unstructured":"Chung, K.-M., Kalai, Y., Vadhan, S.: Improved Delegation of Computation Using Fully Homomorphic Encryption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 483\u2013501. Springer, Heidelberg (2010)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-45146-4_25","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"C. Dwork","year":"2003","unstructured":"Dwork, C., Goldberg, A.V., Naor, M.: On memory-bound functions for fighting spam. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 426\u2013444. Springer, Heidelberg (2003)"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"C. Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 139\u2013147. Springer, Heidelberg (1993)"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11535218_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"C. Dwork","year":"2005","unstructured":"Dwork, C., Naor, M., Wee, H.: Pebbling and proofs of work. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 37\u201354. Springer, Heidelberg (2005)"},{"key":"31_CR15","unstructured":"Dziembowski, S., Faust, S., Kolmogorov, V., Pietrzak, K.: Proofs of space. Cryptology ePrint Archive, Report 2013\/796 (2013), http:\/\/eprint.iacr.org\/"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-22792-9_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S. Dziembowski","year":"2011","unstructured":"Dziembowski, S., Kazana, T., Wichs, D.: Key-evolution schemes resilient to space-bounded leakage. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 335\u2013353. Springer, Heidelberg (2011)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-19571-6_9","volume-title":"Theory of Cryptography","author":"S. Dziembowski","year":"2011","unstructured":"Dziembowski, S., Kazana, T., Wichs, D.: One-time computable self-erasing functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 125\u2013143. Springer, Heidelberg (2011)"},{"key":"31_CR18","unstructured":"Dziembowski, S., Pietrzak, K., Faust, S.: Proofs of space and a greener bitcoin. Talk presented at Workshop on Leakage, Tampering and Viruses, Warsaw 2013 (2013)"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, CCS 2012, p. 501 (2012)","DOI":"10.1145\/2382196.2382250"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Hastad, J.: On the complexity of interactive proofs with bounded communication. Information Processing Letters (1998)","DOI":"10.1016\/S0020-0190(98)00116-1"},{"key":"31_CR21","first-page":"113","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008","author":"S. Goldwasser","year":"2008","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 113\u2013122. ACM, New York (2008)"},{"key":"31_CR22","unstructured":"Juels, A., Brainard, J.G.: Client puzzles: A cryptographic countermeasure against connection depletion attacks. In: NDSS. The Internet Society (1999)"},{"key":"31_CR23","series-title":"LNCS","first-page":"526","volume-title":"SCN 2014","author":"N.P. Karvelas","year":"2014","unstructured":"Karvelas, N.P., Kiayias, A.: Efficient Proofs of Secure Erasure. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol.\u00a08642, pp. 526\u2013543. Springer, Heidelberg (2014)"},{"key":"31_CR24","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/129712.129782","volume-title":"Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, STOC 1992","author":"J. Kilian","year":"1992","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, STOC 1992, pp. 723\u2013732. ACM, New York (1992)"},{"issue":"4","key":"31_CR25","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1145\/322344.322354","volume":"29","author":"T. Lengauer","year":"1982","unstructured":"Lengauer, T., Tarjan, R.E.: Asymptotically tight bounds on time-space trade-offs in a pebble game. Journal of the ACM (JACM)\u00a029(4), 1087\u20131130 (1982)","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"31_CR26","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S. Micali","year":"2000","unstructured":"Micali, S.: Computationally sound proofs. SIAM Journal on Computing\u00a030(4), 1253\u20131298 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR27","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system (May 2009)"},{"key":"31_CR28","unstructured":"Percival, C.: Stronger key derivation via sequential memory-hard functions. Presented at BSDCan 2009 (2009)"},{"key":"31_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-15497-3_39","volume-title":"Computer Security \u2013 ESORICS 2010","author":"D. Perito","year":"2010","unstructured":"Perito, D., Tsudik, G.: Secure code update for embedded devices via proofs of secure erasure. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol.\u00a06345, pp. 643\u2013662. Springer, Heidelberg (2010)"},{"issue":"2","key":"31_CR30","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0206022","volume":"6","author":"N. Pippenger","year":"1977","unstructured":"Pippenger, N.: Superconcentrators. SIAM J. Comput.\u00a06(2), 298\u2013304 (1977)","journal-title":"SIAM J. Comput."},{"key":"31_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-89255-7_7","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"H. Shacham","year":"2008","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 90\u2013107. Springer, Heidelberg (2008)"},{"key":"31_CR32","unstructured":"Smith, A., Zhang, Y.: Near-linear time, leakage-resilient key evolution schemes from expander graphs. IACR Cryptology ePrint Archive, 2013:864 (2013)"},{"key":"31_CR33","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/800133.804348","volume-title":"Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978","author":"M. Tompa","year":"1978","unstructured":"Tompa, M.: Time-space tradeoffs for computing functions, using connectivity properties of their circuits. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 196\u2013204. ACM, New York (1978)"},{"key":"31_CR34","first-page":"246","volume-title":"Proceedings of the 11th ACM Conference on Computer and Communications Security, CCS 2004","author":"B. Waters","year":"2004","unstructured":"Waters, B., Juels, A., Alex Halderman, J., Felten, E.W.: New client puzzle outsourcing techniques for dos resistance. In: Proceedings of the 11th ACM Conference on Computer and Communications Security, CCS 2004, pp. 246\u2013256. ACM, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10879-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:50:22Z","timestamp":1746348622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10879-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108780","9783319108797"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10879-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}