Scrypt Is Maximally Memory-Hard
作者： Joël Alwen , Binyi Chen , Krzysztof Pietrzak , Leonid Reyzin , Stefano Tessaro
DOI: 10.1007/978-3-319-56617-7_2
关键词: scrypt 、 Parallel computing 、 Computer science 、 Lower cost 、 Hash function 、 Password hashing 、 Key derivation function 、 Computation
摘要: Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by memory cost. As memory, unlike computation, costs about the same across different platforms, MHFs cannot be evaluated at significantly lower on dedicated hardware like ASICs. have found widespread applications including password hashing, key derivation, and proofs-of-work.
springer.com
sci-hub.st 参考文章(18)
Ari Juels, John G. Brainard, Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks. network and distributed system security symposium. ,(1999)
Markus Jakobsson, Ari Juels, PROOFS OF WORK AND BREAD PUDDING PROTOCOLS (EXTENDED ABSTRACT) Springer US. pp. 258- 272 ,(1999) , 10.1007/978-0-387-35568-9_18
Matthew K Franklin, Dahlia Malkhi, None, Auditable Metering with Lightweight Security financial cryptography. pp. 151- 160 ,(1997) , 10.1007/3-540-63594-7_75
Cynthia Dwork, Moni Naor, Pricing via Processing or Combatting Junk Mail international cryptology conference. pp. 139- 147 ,(1992) , 10.1007/3-540-48071-4_10
Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford, CAPTCHA: using hard AI problems for security theory and application of cryptographic techniques. pp. 294- 311 ,(2003) , 10.1007/3-540-39200-9_18
R. L. Rivest, D. A. Wagner, A. Shamir, Time-lock Puzzles and Timed-release Crypto Massachusetts Institute of Technology. ,(1996)
Cynthia Dwork, Andrew Goldberg, Moni Naor, On Memory-Bound Functions for Fighting Spam Advances in Cryptology - CRYPTO 2003. pp. 426- 444 ,(2003) , 10.1007/978-3-540-45146-4_25
Cynthia Dwork, Moni Naor, Hoeteck Wee, Pebbling and proofs of work international cryptology conference. pp. 37- 54 ,(2005) , 10.1007/11535218_3
Martin Abadi, Mike Burrows, Mark Manasse, Ted Wobber, Moderately hard, memory-bound functions ACM Transactions on Internet Technology. ,vol. 5, pp. 299- 327 ,(2005) , 10.1145/1064340.1064341
Joël Alwen, Vladimir Serbinenko, High Parallel Complexity Graphs and Memory-Hard Functions symposium on the theory of computing. pp. 595- 603 ,(2015) , 10.1145/2746539.2746622