{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:48:03Z","timestamp":1743058083179,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319989884"},{"type":"electronic","value":"9783319989891"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-98989-1_16","type":"book-chapter","created":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T18:14:14Z","timestamp":1533579254000},"page":"309-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["RiffleScrambler \u2013 A Memory-Hard Password Storing Function"],"prefix":"10.1007","author":[{"given":"Karol","family":"Gotfryd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Lorek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"Zag\u00f3rski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,7]]},"reference":[{"key":"16_CR1","unstructured":"Password Hashing Competition. https:\/\/password-hashing.net\/"},{"key":"16_CR2","unstructured":"The Antminer S9 Bitcoin Miner - Bitmain. https:\/\/shop.bitmain.com\/ antminer_s9_asic_bitcoin_miner.htm"},{"key":"16_CR3","unstructured":"yescrypt - a Password Hashing Competition submission. Technical report (2014). https:\/\/password-hashing.net\/submissions\/specs\/yescrypt- v2.pdf"},{"issue":"5","key":"16_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/00029890.1986.11971821","volume":"93","author":"D Aldous","year":"1986","unstructured":"Aldous, D., Diaconis, P.: Shuffling cards and stopping times. Am. Math. Mon. 93(5), 333\u2013348 (1986). http:\/\/www.jstor.org\/stable\/2323590","journal-title":"Am. Math. Mon."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0196-8858(87)90006-6","volume":"97","author":"D Aldous","year":"1987","unstructured":"Aldous, D., Diaconis, P.: Strong uniform times and finite random walks. Adv. Appl. Math. 97, 69\u201397 (1987)","journal-title":"Adv. Appl. Math."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-662-53008-5_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"J Alwen","year":"2016","unstructured":"Alwen, J., Blocki, J.: Efficiently computing data-independent memory-hard functions. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 241\u2013271. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_9"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Alwen, J., Blocki, J.: Towards practical attacks on Argon2i and balloon hashing. In: 2017 IEEE European Symposium on Security and Privacy (EuroS&P), pp. 142\u2013157. IEEE, April 2017. http:\/\/ieeexplore.ieee.org\/document\/7961977\/","DOI":"10.1109\/EuroSP.2017.47"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-56617-7_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J Alwen","year":"2017","unstructured":"Alwen, J., Blocki, J., Pietrzak, K.: Depth-robust graphs and their cumulative memory complexity. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 3\u201332. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_1"},{"key":"16_CR9","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 on Symposium on Theory of Computing - STOC 2015, pp. 595\u2013603. ACM Press, New York (2015). http:\/\/dl.acm.org\/citation.cfm?doid=2746539.2746622","DOI":"10.1145\/2746539.2746622"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Biryukov, A., Dinu, D., Khovratovich, D.: Argon2: new generation of memory-hard functions for password hashing and other applications. In: 2016 IEEE European Symposium on Security and Privacy (EuroS&P), pp. 292\u2013302. IEEE, March 2016. http:\/\/ieeexplore.ieee.org\/document\/7467361\/","DOI":"10.1109\/EuroSP.2016.31"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-53887-6_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Boneh","year":"2016","unstructured":"Boneh, D., Corrigan-Gibbs, H., Schechter, S.: Balloon hashing: a memory-hard function providing provable protection against sequential attacks. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 220\u2013248. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_8"},{"key":"16_CR12","unstructured":"Bradley, W.F.: Superconcentration on a pair of butterflies, January 2017. http:\/\/arxiv.org\/abs\/1401.7263"},{"key":"16_CR13","unstructured":"Burt, K.: PKCS #5: password-based cryptography specification version 2.0. Technical report (2000). https:\/\/tools.ietf.org\/html\/rfc2898"},{"key":"16_CR14","unstructured":"Forler, C., Lucks, S., Wenzel, J.: Catena: a memory-consuming password-scrambling framework. citeseerx.ist.psu.edu\/viewdoc\/download?https:\/\/doi.org\/10.1.1.437.9101&rep=rep1&type=pdf"},{"key":"16_CR15","unstructured":"Forler, C., Lucks, S., Wenzel, J.: The Catena Password-Scrambling Framework (2015). https:\/\/password-hashing.net\/submissions\/specs\/Catena- v5.pdf"},{"issue":"4","key":"16_CR16","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 29(4), 1087\u20131130 (1982). http:\/\/portal.acm.org\/citation.cfm?doid=322344.322354","journal-title":"Journal of the ACM"},{"key":"16_CR17","unstructured":"Percival, C.: Stronger Key Derivation Via Sequential Memory-hard Functions. https:\/\/www.bsdcan.org\/2009\/schedule\/attachments\/ 87_scrypt.pdf"},{"key":"16_CR18","unstructured":"Pornin, T.: The MAKWA password hashing function specifications v1.1 (2015). http:\/\/www.bolet.org\/makwa\/makwa-spec-20150422.pdf"},{"key":"16_CR19","unstructured":"Simplicio, M.A., Almeida, L.C., Andrade, E.R., Dos Santos, P.C.F., Barreto, P.S.L.M.: Lyra2: password hashing scheme with improved security against time-memory trade-offs. https:\/\/eprint.iacr.org\/2015\/136.pdf"},{"issue":"11","key":"16_CR20","doi-asserted-by":"publisher","first-page":"2776","DOI":"10.1109\/TIFS.2017.2721359","volume":"12","author":"D Wang","year":"2017","unstructured":"Wang, D., Cheng, H., Wang, P., Huang, X., Jian, G.: Zipf\u2019s law in passwords. IEEE Trans. Inf. Forensics Secur. 12(11), 2776\u20132791 (2017). http:\/\/ieeexplore.ieee.org\/document\/7961213\/","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Wang, D., Zhang, Z., Wang, P., Yan, J., Huang, X.: Targeted online password guessing. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS 2016, pp. 1242\u20131254. ACM Press, New York (2016). http:\/\/dl.acm.org\/citation.cfm?doid=2976749.2978339","DOI":"10.1145\/2976749.2978339"}],"container-title":["Lecture Notes in Computer Science","Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98989-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:03:41Z","timestamp":1691453021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-98989-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319989884","9783319989891"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98989-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2018.upc.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}