Quantum security of subset cover problems

ePrint Report: Quantum security of subset cover problems

Samuel Bouaziz--Ermann, Alex B. Grilo, Damien Vergnaud

The subset cover problem for $k \geq 1$ hash functions, which can be seen as an extension of the collision problem, was introduced in 2002 by Reyzin and Reyzin to analyse the security of their hash-function based signature scheme HORS. The security of many hash-based signature schemes relies on this problem or a variant of this problem (e.g. HORS, SPHINCS, SPHINCS+, ...).

Recently, Yuan, Tibouchi …

eprint report problems quantum quantum security security