Trapdoor Memory-Hard Functions

ePrint Report: Trapdoor Memory-Hard Functions

Benedikt Auerbach, Christoph U. Günther, Krzysztof Pietrzak

Memory-hard functions (MHF) are functions whose evaluation provably requires a lot of memory. While MHFs are an unkeyed primitive, it is natural to consider the notion of trapdoor MHFs (TMHFs). A TMHF is like an MHF, but when sampling the public parameters one also samples a trapdoor which allows evaluating the function much cheaper.


Biryukov and Perrin (Asiacrypt'17) were the first to consider TMHFs and put forth a …

eprint report evaluation functions hard lot memory natural notion public report