F-MHF — Memory-hard function, password hashing

F-MHF (Memory-hard function, password hashing) is part of Cryptographic Library and Symmetric Primitives in the UC functionality encyclopedia. Status: open — no accepted UC formulation exists yet.

This is one of several purely local, hardness-based primitives (alongside F-OWF, F-PRG, and F-CRHF) with no cross-party interface to idealize — the UC composition theorem gives nothing here that a standard hybrid argument doesn’t already provide. It’s included in this encyclopedia only to record that absence explicitly. It also sits on its own boundary: a memory-hard function’s security statement is a cost lower bound rather than an indistinguishability guarantee, which resists UC formulation for a third, independent reason.