Towards the Impossibility of Imperfectly Complete Key Agreement in the QROM
The paper proves that unconditional attacks exist against imperfectly complete quantum-computation, classical-communication (QCCC) key agreement protocols in restricted settings. By showing that an attacker can recover a shared key with polynomial queries if honest parties are query-bounded polynomially, the authors rule out certain forms of imperfectly correct quantum public-key encryption.