Quantum security of hash functions and property-preservation of iterated hashing

by   Ben Hamlin, et al.

This work contains two major parts: comprehensively studying the security notions of cryptographic hash functions against quantum attacks and the relationships between them; and revisiting whether Merkle-Damgard and related iterated hash constructions preserve the security properties of the compression function in the quantum setting. Specifically, we adapt the seven notions in Rogaway and Shrimpton (FSE'04) to the quantum setting and prove that the seemingly stronger attack model where an adversary accesses a challenger in quantum superposition does not make a difference. We confirm the implications and separations between the seven properties in the quantum setting, and in addition we construct explicit examples separating an inherently quantum notion called collapsing from several proposed properties. Finally, we pin down the properties that are preserved under several iterated hash schemes. In particular, we prove that the ROX construction in Andreeva et al. (Asiacrypt'07) preserves the seven properties in the quantum random oracle model.



There are no comments yet.


page 1

page 2

page 3

page 4


Quantum collision finding for homomorphic hash functions

Hash functions are a basic cryptographic primitive. Certain hash functio...

Quantum-secure message authentication via blind-unforgeability

We consider the problem of unforgeable authentication of classical messa...

Crooked Indifferentiability Revisited

In CRYPTO 2018, Russell et al introduced the notion of crooked indiffere...

Quantum Lightning Never Strikes the Same State Twice

Public key quantum money can be seen as a version of the quantum no-clon...

Weakened Random Oracle Models with Target Prefix

Weakened random oracle models (WROMs) are variants of the random oracle ...

Quantum Search for Scaled Hash Function Preimages

We present the implementation of Grover's algorithm in a quantum simulat...

Inaccessible Entropy II: IE Functions and Universal One-Way Hashing

This paper uses a variant of the notion of inaccessible entropy (Haitner...
This week in AI

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