{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:39:03Z","timestamp":1777549143744,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662498958","type":"print"},{"value":"9783662498965","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49896-5_13","type":"book-chapter","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T04:45:32Z","timestamp":1461732332000},"page":"358-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model"],"prefix":"10.1007","author":[{"given":"Jo\u00ebl","family":"Alwen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chethan","family":"Kamath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Kolmogorov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,28]]},"reference":[{"key":"13_CR1","unstructured":"Crypto-Currency Market Capitalizations. \n                    http:\/\/coinmarketcap.com\/\n                    \n                  . Accessed 10 July 2015"},{"issue":"2","key":"13_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s13389-013-0063-5","volume":"4","author":"Leonardo C. Almeida","year":"2014","unstructured":"Almeida, L.C., Andrade, E.R., Barreto, P.S.L. M., Simplicio Jr., M.A.: Lyra: Password-based key derivation with tunable memory and processing costs. Cryptology ePrint Archive, report 2014\/030 (2014). \n                    http:\/\/eprint.iacr.org\/2014\/030","journal-title":"Journal of Cryptographic Engineering"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Alwen, J., Serbinenko, V.: High parallel complexity graphs and memory-hard functions. In: Servedio, R.A., Rubinfeld, R. (eds) 47th ACM STOC, pp. 595\u2013603. ACM Press, June 2015","DOI":"10.1145\/2746539.2746622"},{"key":"13_CR4","unstructured":"Biryukov, A., Dinu, D., Khovratovich, D.: Fast and tradeoff-resilient memory-hard functions for cryptocurrencies and password hashing. Cryptology ePrint Archive, report 2015\/430 (2015). \n                    http:\/\/eprint.iacr.org\/2015\/430"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-662-48800-3_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Banik","year":"2015","unstructured":"Banik, S., Bogdanov, A., Isobe, T., Shibutani, K., Hiwatari, H., Akishita, T., Regazzoni, F.: Midori: a block cipher for low energy. In: Iwata, T., et al. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 411\u2013436. Springer, Heidelberg (2015). doi:\n                    10.1007\/978-3-662-48800-3_17"},{"key":"13_CR6","first-page":"256","volume":"14","author":"J Chang","year":"2014","unstructured":"Chang, J., Mishra, S., Kumar Sanadhya, S.: Time memory tradeoff analysis of graphs in password hashing constructions. Preproc. PASSWORDS 14, 256\u2013266 (2014)","journal-title":"Preproc. PASSWORDS"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology - CRYPTO 1992","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. 740, pp. 139\u2013147. Springer, Heidelberg (1993)"},{"key":"13_CR8","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.M.: Pebbling and proofs of work. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 37\u201354. Springer, Heidelberg (2005)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-662-48000-7_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Dziembowski","year":"2015","unstructured":"Dziembowski, S., Faust, S., Kolmogorov, V., Pietrzak, K.: Proofs of space. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 585\u2013605. Springer, Heidelberg (2015)"},{"key":"13_CR10","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. 6597, pp. 125\u2013143. Springer, Heidelberg (2011)"},{"key":"13_CR11","unstructured":"Forler, C., Lucks, S., Wenzel, J.: Catena: a memory-consuming password scrambler. Cryptology ePrint Archive, report 2013\/525 (2013). \n                    http:\/\/eprint.iacr.org\/2013\/525"},{"key":"13_CR12","unstructured":"Jakobsson, M., Juels, A.: Proofs of work, bread pudding protocols. In: Preneel, B., (ed.) Secure Information Networks: Observation of strains. Infect Dis. Ther. 3(1), 35\u201343.: Communications and Multimedia Security, IFIP TC6\/TC11 Joint Working Conference on Communications and Multimedia Security (CMS 1999), 20\u201321 September 1999, Leuven, Belgium, vol. 152 of IFIP Conference Proceedings, pp. 258\u2013272. Kluwer, 1999 (2011)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Kaliski, B.: PKCS #5: Password-based cryptography specification version 2.0 (2000)","DOI":"10.17487\/rfc2898"},{"key":"13_CR14","unstructured":"Lee, C.: Litecoin (2011). \n                    https:\/\/litecoin.org\/"},{"key":"13_CR15","unstructured":"Park, S., Pietrzak, K., Kwon, A., Alwen, J., Fuchsbauer, G., Ga\u017ei, P.: Spacemint: A cryptocurrency based on proofs of space. Cryptology ePrint Archive, report 2015\/528 (2015). \n                    http:\/\/eprint.iacr.org\/2015\/528"},{"key":"13_CR16","unstructured":"Percival, C. :Stronger key derivation via sequential memory-hard functions (2009). \n                    http:\/\/www.tarsnap.com\/scrypt\/scrypt.pdf"},{"key":"13_CR17","unstructured":"Corrigan-Gibbs, H., Boneh, D., Schechter, S.: Balloon Hashing: Provably Space-Hard Hash Functions with Data-Independent Access Patterns. Cryptology ePrint Archive, Report 2016\/027 (2016). \n                    http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49896-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T00:04:02Z","timestamp":1588032242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49896-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662498958","9783662498965"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49896-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}