Strict memory hard hash functions

Strict memory hard functions are an extension of memory hard functions such that a slight reduction in the memory available for computation, compared to a predefined optimal memory size, makes the function evaluation exponentially slower or infeasible. The main application of strict memory hard functions is to prove a certain amount of memory is used during a certain time interval or in a certain computation. This in turn can be used to attest that areas of memory of devices do not contain hidden data. Other applications are password hashing and proof of work. Here I present a preliminary paper of  SeqMemoHash, a strict sequential memory hard functions under the random oracle model.

Please send me comments regarding the security of these constructions!


  1. Leave a comment

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: