RiffleScrambler - a memory-hard password storing function

07/17/2018
by   Karol Gotfryd, et al.
0

We introduce RiffleScrambler: a new family of directed acyclic graphs and a corresponding data-independent memory hard function with password independent memory access. We prove its memory hardness in the random oracle model. RiffleScrambler is similar to Catena -- updates of hashes are determined by a graph (bit-reversal or double-butterfly graph in Catena). The advantage of the RiffleScrambler over Catena is that the underlying graphs are not predefined but are generated per salt, as in Balloon Hashing. Such an approach leads to higher immunity against practical parallel attacks. RiffleScrambler offers better efficiency than Balloon Hashing since the in-degree of the underlying graph is equal to 3 (and is much smaller than in Ballon Hashing). At the same time, because the underlying graph is an instance of a Superconcentrator, our construction achieves the same time-memory trade-offs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/21/2018

Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling

Pebble games were originally formulated to study time-space tradeoffs in...
05/23/2011

b-Bit Minwise Hashing for Large-Scale Linear SVM

In this paper, we propose to (seamlessly) integrate b-bit minwise hashin...
01/08/2020

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

We establish an exactly tight relation between reversible pebblings of g...
04/17/2019

Approximating Cumulative Pebbling Cost is Unique Games Hard

The cumulative pebbling complexity of a directed acyclic graph G is defi...
09/11/2019

Independent Domination in Directed Graphs

In this paper we initialize the study of independent domination in direc...
02/27/2018

Constructing graphs with limited resources

We discuss the amount of physical resources required to construct a give...
11/15/2019

Computationally Data-Independent Memory Hard Functions

Memory hard functions (MHFs) are an important cryptographic primitive th...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.