{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T20:49:30Z","timestamp":1762980570068,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T00:00:00Z","timestamp":1527552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Union's Seventh Framework Programme (FP7\/2007-2013)","award":["616160"],"award-info":[{"award-number":["616160"]}]},{"name":"European Research Council consolidator grant","award":["682815-TOCNeT"],"award-info":[{"award-number":["682815-TOCNeT"]}]},{"name":"US NSF","award":["1012910, 1012798, 1422965"],"award-info":[{"award-number":["1012910, 1012798, 1422965"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,29]]},"DOI":"10.1145\/3196494.3196534","type":"proceedings-article","created":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T13:18:28Z","timestamp":1527772708000},"page":"51-65","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["On the Memory-Hardness of Data-Independent Password-Hashing Functions"],"prefix":"10.1145","author":[{"given":"Joel","family":"Alwen","sequence":"first","affiliation":[{"name":"IST Austria &Wickr Inc., Vienna, \/ New York City, Austria"}]},{"given":"Peter","family":"Gazi","sequence":"additional","affiliation":[{"name":"IOHK, Vienna, Austria"}]},{"given":"Chethan","family":"Kamath","sequence":"additional","affiliation":[{"name":"IST Austria, Vienna, Austria"}]},{"given":"Karen","family":"Klein","sequence":"additional","affiliation":[{"name":"IST Austria, Vienna, Austria"}]},{"given":"Georg","family":"Osang","sequence":"additional","affiliation":[{"name":"IST Austria, Vienna, Austria"}]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[{"name":"IST Austria, Vienna, Austria"}]},{"given":"Lenoid","family":"Reyzin","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}]},{"given":"Michal","family":"Rolinek","sequence":"additional","affiliation":[{"name":"IST Austria, Vienna, Austria"}]},{"given":"Michal","family":"Rybar","sequence":"additional","affiliation":[{"name":"IST Austria, Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2018,5,29]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Password hashing competition. https:\/\/password-hashing.net\/.  Password hashing competition. https:\/\/password-hashing.net\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53008-5_9"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2017.47"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134031"},{"key":"e_1_3_2_1_5_1","first-page":"3","volume-title":"Advances in Cryptology - EUROCRYPT","author":"Alwen Jo\u00ebl","year":"2017","unstructured":"Jo\u00ebl Alwen , Jeremiah Blocki , and Krzysztof Pietrzak . Depth-robust graphs and their cumulative memory complexity . In Advances in Cryptology - EUROCRYPT 2017 , Paris, France, April 30-May 4, 2017, LNCS Vol . 10212, pages 3 -- 32 , 2017. Jo\u00ebl Alwen, Jeremiah Blocki, and Krzysztof Pietrzak. Depth-robust graphs and their cumulative memory complexity. In Advances in Cryptology - EUROCRYPT 2017, Paris, France, April 30-May 4, 2017, LNCS Vol. 10212, pages 3--32, 2017."},{"key":"e_1_3_2_1_6_1","volume-title":"Advances in Cryptology - EUROCRYPT","author":"Alwen Jo\u00ebl","year":"2018","unstructured":"Jo\u00ebl Alwen , Jeremiah Blocki , and Krzysztof Pietrzak . Sustained space complexity . In Advances in Cryptology - EUROCRYPT 2018 , Tel Aviv , Israel, April 28-May 3, 2018, 2018. Jo\u00ebl Alwen, Jeremiah Blocki, and Krzysztof Pietrzak. Sustained space complexity. In Advances in Cryptology - EUROCRYPT 2018, Tel Aviv, Israel, April 28-May 3, 2018, 2018."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746622"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Guido\n      Bertoni Joan\n      Daemen Michael\n      Peeters and \n      Gilles Van\n      Assche\n    .\n  On the indifferentiability of the sponge construction\n  . In Nigel P. Smart editor EUROCRYPT \n  2008 volume \n  4965\n   of \n  LNCS pages \n  181\n  --\n  197\n  . \n  Springer Heidelberg April 2008.   Guido Bertoni Joan Daemen Michael Peeters and Gilles Van Assche. On the indifferentiability of the sponge construction. In Nigel P. Smart editor EUROCRYPT 2008 volume 4965 of LNCS pages 181--197. Springer Heidelberg April 2008.","DOI":"10.1007\/978-3-540-78967-3_11"},{"key":"e_1_3_2_1_10_1","volume-title":"The keccak reference","author":"Bertoni Guido","year":"2011","unstructured":"Guido Bertoni , Joan Daemen , Micha\u00ebl Peeters , and Gilles Van Assche . The keccak reference , 2011 . Guido Bertoni, Joan Daemen, Micha\u00ebl Peeters, and Gilles Van Assche. The keccak reference, 2011."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2016.31"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48800-3_26"},{"key":"e_1_3_2_1_14_1","first-page":"445","volume-title":"TCC 2017","volume":"10677","author":"Blocki Jeremiah","year":"2017","unstructured":"Jeremiah Blocki and Samson Zhou . On the depth-robustness and cumulative pebbling cost of argon2i. In Theory of Cryptography - 15th International Conference , TCC 2017 , Baltimore, MD, USA , Nov. 12-15, 2017 , LNCS Vol. 10677 , pages 445 -- 465 , 2017. Jeremiah Blocki and Samson Zhou. On the depth-robustness and cumulative pebbling cost of argon2i. In Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, Nov. 12-15, 2017, LNCS Vol. 10677, pages 445--465, 2017."},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-662-53887-6_8","volume-title":"Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security","author":"Boneh Dan","year":"2016","unstructured":"Dan Boneh , Henry Corrigan-Gibbs , and Stuart E. Schechter . Balloon hashing: A memory-hard function providing provable protection against sequential attacks . In Jung Hee Cheon and Tsuyoshi Takagi, editors, Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security , Hanoi, Vietnam, December 4-8, 2016 , Proceedings, Part I, volume 10031 of Lecture Notes in Computer Science , pages 220 -- 248 , 2016. Dan Boneh, Henry Corrigan-Gibbs, and Stuart E. Schechter. Balloon hashing: A memory-hard function providing provable protection against sequential attacks. In Jung Hee Cheon and Tsuyoshi Takagi, editors, Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I, volume 10031 of Lecture Notes in Computer Science, pages 220--248, 2016."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12087-4_23"},{"key":"e_1_3_2_1_17_1","volume-title":"Rig: A simple, secure and flexible design for password hashing version 2.0","author":"Chang Donghoon","year":"2014","unstructured":"Donghoon Chang , Arpan Jati , Sweta Mishra , and Somitra Kumar Sanadhya . Rig: A simple, secure and flexible design for password hashing version 2.0 . 2014 . Donghoon Chang, Arpan Jati, Sweta Mishra, and Somitra Kumar Sanadhya. Rig: A simple, secure and flexible design for password hashing version 2.0. 2014."},{"key":"e_1_3_2_1_18_1","volume-title":"A compute time and sequential memory hard password hashing scheme. Password Hashing Competition. v0 edn","author":"Cox Bill","year":"2014","unstructured":"Bill Cox . Twocats (and skinnycat) : A compute time and sequential memory hard password hashing scheme. Password Hashing Competition. v0 edn ., 2014 . Bill Cox. Twocats (and skinnycat): A compute time and sequential memory hard password hashing scheme. Password Hashing Competition. v0 edn., 2014."},{"key":"e_1_3_2_1_20_1","volume-title":"The catena password-scrambling framework","author":"Forler Christian","year":"2015","unstructured":"Christian Forler , Stefan Lucks , and Jakob Wenzel . The catena password-scrambling framework , 2015 . Christian Forler, Stefan Lucks, and Jakob Wenzel. The catena password-scrambling framework, 2015."},{"key":"e_1_3_2_1_21_1","unstructured":"Marcos A. Simplicio  Jr. Leonardo C. Almeida Ewerton R. Andrade Paulo C. F. dos Santos and Paulo S. L. M. Barreto. Lyra2: Password Hashing Scheme with improved security against time-memory trade-offs.  Marcos A. Simplicio Jr. Leonardo C. Almeida Ewerton R. Andrade Paulo C. F. dos Santos and Paulo S. L. M. Barreto. Lyra2: Password Hashing Scheme with improved security against time-memory trade-offs."},{"key":"e_1_3_2_1_22_1","first-page":"2009","author":"Percival C.","year":"2009","unstructured":"C. Percival . Stronger key derivation via sequential memory-hard functions. In BSDCan 2009 , 2009 . C. Percival. Stronger key derivation via sequential memory-hard functions. In BSDCan 2009, 2009.","journal-title":"BSDCan"},{"key":"e_1_3_2_1_23_1","volume-title":"Gambit -- A sponge based, memory hard key derivation function. Submission to Password Hashing Competition (PHC)","author":"Pint\u00e9r Kriszti\u00e1n","year":"2014","unstructured":"Kriszti\u00e1n Pint\u00e9r . Gambit -- A sponge based, memory hard key derivation function. Submission to Password Hashing Competition (PHC) , 2014 . Kriszti\u00e1n Pint\u00e9r. Gambit -- A sponge based, memory hard key derivation function. Submission to Password Hashing Competition (PHC), 2014."},{"key":"e_1_3_2_1_24_1","first-page":"466","volume-title":"TCC 2017","volume":"10677","author":"Ren Ling","year":"2017","unstructured":"Ling Ren and Srinivas Devadas . Bandwidth hard functions for ASIC resistance. In Theory of Cryptography - 15th International Conference , TCC 2017 , Baltimore, MD, USA , Nov. 12-15, 2017 , LNCS Vol. 10677 , pages 466 -- 492 , 2017. Ling Ren and Srinivas Devadas. Bandwidth hard functions for ASIC resistance. In Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, Nov. 12-15, 2017, LNCS Vol. 10677, pages 466--492, 2017."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804401"},{"key":"e_1_3_2_1_26_1","volume-title":"POMELO -- A Password Hashing Algorithm","author":"Wu Hongjun","year":"2015","unstructured":"Hongjun Wu . POMELO -- A Password Hashing Algorithm , 2015 . Hongjun Wu. POMELO -- A Password Hashing Algorithm, 2015."}],"event":{"name":"ASIA CCS '18: ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Incheon Republic of Korea","acronym":"ASIA CCS '18"},"container-title":["Proceedings of the 2018 on Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196494.3196534","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3196494.3196534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:39Z","timestamp":1750208919000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196494.3196534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,29]]},"references-count":23,"alternative-id":["10.1145\/3196494.3196534","10.1145\/3196494"],"URL":"https:\/\/doi.org\/10.1145\/3196494.3196534","relation":{},"subject":[],"published":{"date-parts":[[2018,5,29]]},"assertion":[{"value":"2018-05-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}