{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T10:06:38Z","timestamp":1777025198655,"version":"3.51.4"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683787","type":"print"},{"value":"9783031683794","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-68379-4_1","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T20:17:23Z","timestamp":1723753043000},"page":"3-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Advancing Scalability in\u00a0Decentralized Storage: A Novel Approach to\u00a0Proof-of-Replication via\u00a0Polynomial Evaluation"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Ateniese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Foteini","family":"Baldimtsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Campanelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4639-0636","authenticated-orcid":false,"given":"Danilo","family":"Francati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioanna","family":"Karantaidou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"1_CR1","unstructured":"Filecoin whitepaper (2017). https:\/\/filecoin.io\/filecoin.pdf"},{"key":"1_CR2","unstructured":"Effects of chia mining on hard drives (2023). https:\/\/platinumdatarecovery.com\/blog\/chia-crypto-mining-can-kill-your-ssd-or-hard-drive"},{"issue":"2","key":"1_CR3","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. (TOIT) 5(2), 299\u2013327 (2005)","journal-title":"ACM Trans. Internet Technol. (TOIT)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-70697-9_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part II","author":"H Abusalah","year":"2017","unstructured":"Abusalah, H., Alwen, J., Cohen, B., Khilko, D., Pietrzak, K., Reyzin, L.: Beyond Hellman\u2019s time-memory trade-offs with applications to proofs of space. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part II, pp. 357\u2013379. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_13"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-662-53008-5_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II","author":"J Alwen","year":"2016","unstructured":"Alwen, J., Blocki, J.: Efficiently computing data-independent memory-hard functions. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology \u2013 CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II, pp. 241\u2013271. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_9"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-662-49896-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II","author":"J Alwen","year":"2016","unstructured":"Alwen, J., Chen, B., Kamath, C., Kolmogorov, V., Pietrzak, K., Tessaro, S.: On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Fischlin, M., Coron, J.-S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II, pp. 358\u2013387. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_13"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Alwen, J., Serbinenko, V.: High parallel complexity graphs and memory-hard functions. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 595\u2013603 (2015)","DOI":"10.1145\/2746539.2746622"},{"key":"1_CR8","unstructured":"Armknecht, F., Barman, L., Bohli, J.M., Karame, G.O.: Mirror: enabling proofs of data replication and retrievability in the cloud. In: 25th USENIX Security Symposium (USENIX Security 16), pp. 1051\u20131068 (2016)"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Armknecht, F., Bohli, J.M., Karame, G.O., Liu, Z., Reuter, C.A.: Outsourced proofs of retrievability. In: Ahn, G.J., Yung, M., Li, N. (eds.) ACM CCS 2014. pp. 831\u2013843. ACM Press (2014). https:\/\/doi.org\/10.1145\/2660267.2660310","DOI":"10.1145\/2660267.2660310"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.jsc.2015.11.005","volume":"75","author":"A Arnold","year":"2016","unstructured":"Arnold, A., Giesbrecht, M., Roche, D.S.: Faster sparse multivariate polynomial interpolation of straight-line programs. J. Symb. Comput. 75, 4\u201324 (2016)","journal-title":"J. Symb. Comput."},{"key":"1_CR11","unstructured":"Ateniese, G., Baldimtsi, F., Campanelli, M., Francati, D., Karantaidou, I.: Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation. Cryptology ePrint Archive, Paper 2023\/1569 (2023). https:\/\/eprint.iacr.org\/2023\/1569"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-319-10879-7_31","volume-title":"Security and Cryptography for Networks","author":"G Ateniese","year":"2014","unstructured":"Ateniese, G., Bonacina, I., Faonio, A., Galesi, N.: Proofs of Space: when space is of the essence. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 538\u2013557. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_31"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Ateniese, G., et al.: Provable data possession at untrusted stores. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 598\u2013609 (2007)","DOI":"10.1145\/1315245.1315318"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Chen, L., Etemad, M., Tang, Q.: Proof of storage-time: efficiently checking continuous data availability. NDSS (2020)","DOI":"10.14722\/ndss.2020.24427"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-031-31371-4_3","volume-title":"Public-Key Cryptography \u2013 PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7\u201310, 2023, Proceedings, Part II","author":"G Ateniese","year":"2023","unstructured":"Ateniese, G., Chen, L., Francati, D., Papadopoulos, D., Tang, Q.: Verifiable capacity-bound functions: a new primitive from\u00a0Kolmogorov complexity: (revisiting space-based security in the adaptive setting). In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography \u2013 PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7\u201310, 2023, Proceedings, Part II, pp. 63\u201393. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_3"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Di\u00a0Pietro, R., Mancini, L.V., Tsudik, G.: Scalable and efficient provable data possession. In: Proceedings of the 4th International Conference on Security and Privacy in Communication Netowrks, pp. 1\u201310 (2008)","DOI":"10.1145\/1460877.1460889"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/978-3-662-48800-3_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015: 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 \u2013 December 3, 2015, Proceedings, Part II","author":"A Biryukov","year":"2015","unstructured":"Biryukov, A., Khovratovich, D.: Tradeoff cryptanalysis of memory-hard functions. In: Iwata, T., Cheon, J.H. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2015: 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 \u2013 December 3, 2015, Proceedings, Part II, pp. 633\u2013657. Springer, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_26"},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1109\/TAU.1970.1162132","volume":"18","author":"L Bluestein","year":"1970","unstructured":"Bluestein, L.: A linear filtering approach to the computation of discrete fourier transform. IEEE Trans. Audio Electroacoust. 18(4), 451\u2013455 (1970). https:\/\/doi.org\/10.1109\/TAU.1970.1162132","journal-title":"IEEE Trans. Audio Electroacoust."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part I","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part I, pp. 757\u2013788. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Borge, M., Kokoris-Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., Ford, B.: Proof-of-personhood: Redemocratizing permissionless cryptocurrencies. In: 2017 IEEE European Symposium on Security and Privacy Workshops, EuroS &P Workshops 2017, Paris, France, April 26-28, 2017, pp. 23\u201326. IEEE (2017). https:\/\/doi.org\/10.1109\/EuroSPW.2017.46","DOI":"10.1109\/EuroSPW.2017.46"},{"issue":"4","key":"1_CR21","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.jco.2004.09.009","volume":"21","author":"A Bostan","year":"2005","unstructured":"Bostan, A., Schost, \u00c9.: Polynomial evaluation and interpolation on special sets of points. J. Complex. 21(4), 420\u2013446 (2005)","journal-title":"J. Complex."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00145-015-9216-2","volume":"30","author":"D Cash","year":"2017","unstructured":"Cash, D., K\u00fcp\u00e7\u00fc, A., Wichs, D.: Dynamic proofs of retrievability via oblivious ram. J. Cryptol. 30, 22\u201357 (2017)","journal-title":"J. Cryptol."},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-319-78375-8_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part II","author":"B Cohen","year":"2018","unstructured":"Cohen, B., Pietrzak, K.: Simple proofs of sequential work. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part II, pp. 451\u2013467. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_15"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: An observation on time-storage trade off. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp. 29\u201333 (1973)","DOI":"10.1145\/800125.804032"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Khan, O., Burns, R., Ateniese, G.: MR-PDP: multiple-replica provable data possession. In: 2008 the 28th International Conference on Distributed Computing Systems, pp. 411\u2013420. IEEE (2008)","DOI":"10.1109\/ICDCS.2008.68"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Daian, P., Pass, R., Shi, E.: Snow white: robustly reconfigurable consensus and applications to provably secure proof of stake. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 23\u201341. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_2","DOI":"10.1007\/978-3-030-32101-7_2"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Ganesh, C., Orlandi, C.: Proofs of replicated storage without timing assumptions. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0I. LNCS, vol. 11692, pp. 355\u2013380. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_13","DOI":"10.1007\/978-3-030-26948-7_13"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"David, B., Gazi, P., Kiayias, A., Russell, A.: Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT\u00a02018, Part\u00a0II. LNCS, vol. 10821, pp. 66\u201398. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3","DOI":"10.1007\/978-3-319-78375-8_3"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-00457-5_8","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2009","unstructured":"Dodis, Y., Vadhan, S., Wichs, D.: Proofs of retrievability via hardness amplification. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 109\u2013127. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_8"},{"key":"1_CR30","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. 3621, pp. 37\u201354. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_3"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-662-48000-7_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015: 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II","author":"S Dziembowski","year":"2015","unstructured":"Dziembowski, S., Faust, S., Kolmogorov, V., Pietrzak, K.: Proofs of space. In: Gennaro, R., Robshaw, M. (eds.) Advances in Cryptology \u2013 CRYPTO 2015: 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II, pp. 585\u2013605. Springer, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_29"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-030-17656-3_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part II","author":"B Fisch","year":"2019","unstructured":"Fisch, B.: Tight proofs of space and replication. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part II, pp. 324\u2013348. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_12"},{"key":"1_CR33","unstructured":"Fisch, B., Bonneau, J., Benet, J., Greco, N.: Proofs of replication using depth robust graphs. Blockchain Protocol Anal. Secur. Eng. 2018 (2018)"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II, pp. 281\u2013310. Springer, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"Hanling, M., Anthoine, G., Dumas, J.G., Maignan, A., Pernet, C., Roche, D.S.: Poster: proofs of retrievability with low server storage. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 2601\u20132603. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3363266","DOI":"10.1145\/3319535.3363266"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Van\u00a0der Hoeven, J.: The truncated fourier transform and applications. In: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, pp. 290\u2013296 (2004)","DOI":"10.1145\/1005285.1005327"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Hopcroft, J., Paul, W., Valiant, L.: On time versus space and related problems. In: 16th Annual Symposium on Foundations of Computer Science (SFCS 1975), pp. 57\u201364. IEEE (1975)","DOI":"10.1109\/SFCS.1975.23"},{"issue":"2","key":"1_CR38","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1006\/jcom.1998.0476","volume":"14","author":"X Huang","year":"1998","unstructured":"Huang, X., Pan, V.Y.: Fast rectangular matrix multiplication and applications. J. Complex. 14(2), 257\u2013299 (1998)","journal-title":"J. Complex."},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Juels, A., Kaliski Jr., B.S.: PORs: proofs of retrievability for large files. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) ACM CCS 2007. pp. 584\u2013597. ACM Press (2007). https:\/\/doi.org\/10.1145\/1315245.1315317","DOI":"10.1145\/1315245.1315317"},{"key":"1_CR40","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) Advances in Cryptology - ASIACRYPT 2010, pp. 177\u2013194. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"issue":"6","key":"1_CR41","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1137\/08073408X","volume":"40","author":"KS Kedlaya","year":"2011","unstructured":"Kedlaya, K.S., Umans, C.: Fast polynomial factorization and modular composition. SIAM J. Comput. 40(6), 1767\u20131802 (2011)","journal-title":"SIAM J. Comput."},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-90453-1_1","volume-title":"Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8\u201311, 2021, Proceedings, Part II","author":"J Lee","year":"2021","unstructured":"Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. In: Nissim, K., Waters, B. (eds.) Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8\u201311, 2021, Proceedings, Part II, pp. 1\u201334. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_1"},{"issue":"4","key":"1_CR43","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. J. ACM (JACM) 29(4), 1087\u20131130 (1982)","journal-title":"J. ACM (JACM)"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Lin, W.K., Mook, E., Wichs, D.: Doubly efficient private information retrieval and fully homomorphic ram computation from ring LWE. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 595\u2013608 (2023)","DOI":"10.1145\/3564246.3585175"},{"key":"1_CR45","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2009). http:\/\/www.bitcoin.org\/bitcoin.pdf"},{"key":"1_CR46","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-540-30140-0_49","volume-title":"Algorithms \u2013 ESA 2004","author":"M N\u00fcsken","year":"2004","unstructured":"N\u00fcsken, M., Ziegler, M.: Fast multipoint evaluation of bivariate polynomials. In: Albers, S., Radzik, T. (eds.) Algorithms \u2013 ESA 2004, pp. 544\u2013555. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_49"},{"key":"1_CR47","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-36594-2_13","volume-title":"Theory of Cryptography","author":"C Papamanthou","year":"2013","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Sahai, A. (ed.) Theory of Cryptography, pp. 222\u2013242. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_13"},{"key":"1_CR48","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF00289150","volume":"10","author":"WJ Paul","year":"1978","unstructured":"Paul, W.J., Tarjan, R.E.: Time-space trade-offs in a pebble game. Acta Informatica 10, 111\u2013115 (1978)","journal-title":"Acta Informatica"},{"key":"1_CR49","unstructured":"Pietrzak, K.: Proofs of catalytic space. Cryptology ePrint Archive (2018)"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Rabaninejad, R., Abdolmaleki, B., Malavolta, G., Michalas, A., Nabizadeh, A.: stoRNA: stateless transparent proofs of storage-time. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-51479-1_20"},{"key":"1_CR51","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-662-53641-4_11","volume-title":"Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I","author":"L Ren","year":"2016","unstructured":"Ren, L., Devadas, S.: Proof of space from stacked expanders. In: Hirt, M., Smith, A. (eds.) Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I, pp. 262\u2013285. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_11"},{"issue":"3","key":"1_CR52","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s00145-012-9129-2","volume":"26","author":"H Shacham","year":"2013","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. J. Cryptol. 26(3), 442\u2013483 (2013)","journal-title":"J. Cryptol."},{"key":"1_CR53","doi-asserted-by":"publisher","unstructured":"Shi, E., Stefanov, E., Papamanthou, C.: Practical dynamic proofs of retrievability. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 325\u2013336. ACM Press (2013). https:\/\/doi.org\/10.1145\/2508859.2516669","DOI":"10.1145\/2508859.2516669"},{"key":"1_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78524-8_1","volume-title":"Theory of Cryptography","author":"P Valiant","year":"2008","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) Theory of Cryptography, pp. 1\u201318. Springer, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1"},{"key":"1_CR55","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.jsc.2012.06.004","volume":"50","author":"J Van Der Hoeven","year":"2013","unstructured":"Van Der Hoeven, J., Lecerf, G.: On the bit-complexity of sparse polynomial and series multiplication. J. Symb. Comput. 50, 227\u2013254 (2013)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"1_CR56","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00200-012-0179-3","volume":"24","author":"J Van Der Hoeven","year":"2013","unstructured":"Van Der Hoeven, J., Schost, \u00c9.: Multi-point evaluation in higher dimensions. Appl. Algebra Eng. Commun. Comput. 24(1), 37\u201352 (2013)","journal-title":"Appl. Algebra Eng. Commun. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68379-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T20:17:58Z","timestamp":1723753078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68379-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683787","9783031683794"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68379-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}