Quantum Collision-Resistance of Non-Uniformly Distributed Functions

Abstract. We study the quantum query complexity of finding a collision for a function f whose outputs are chosen according to a distribution with min-entropy k. We prove that Ω(2k/9 ) quantum queries are necessary to find a collision for function f. This is needed in some security proofs in the quantum random oracle model (e.g. Fujisaki-Okamoto transform).

• Type: Journal
• Year: 2016
• Where: IACR
• Authors: Ehsan Ebrahimi Targhi, Gelo Noel Tabia, Dominique Unruh
• Keywords: Biometrics, IACR 2016