Paper 2018/944
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions
Jeremiah Blocki, Ben Harsha, Siteng Kang, Seunghoon Lee, Lu Xing, and Samson Zhou
Abstract
Memory-hard functions (MHFs) are a key cryptographic primitive underlying the design of moderately expensive password hashing algorithms and egalitarian proofs of work. Over the past few years several increasingly stringent goals for an MHF have been proposed including the requirement that the MHF have high sequential space-time (ST) complexity, parallel space-time complexity, amortized area-time (aAT) complexity and sustained space complexity.
Data-Independent Memory Hard Functions (iMHFs) are of special interest in the context of password hashing as they naturally resist side-channel attacks.
iMHFs can be specified using a directed acyclic graph (DAG)
Note: Full version of CRYPTO 2019 paper
Metadata
- Available format(s)
-
PDF
- Publication info
- A major revision of an IACR publication in CRYPTO 2019
- Keywords
- Memory Hard FunctionDepth-Robust GraphSustained Space ComplexityGraph Pebbling
- Contact author(s)
- jblocki @ purdue edu
- History
- 2019-06-04: last of 3 revisions
- 2018-10-05: received
- See all versions
- Short URL
- https://ia.cr/2018/944
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/944, author = {Jeremiah Blocki and Ben Harsha and Siteng Kang and Seunghoon Lee and Lu Xing and Samson Zhou}, title = {Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/944}, year = {2018}, url = {https://eprint.iacr.org/2018/944} }