Cryptology ePrint Archive: Report 2017/509

Quantum Security of NMAC and Related Constructions

Fang Song and Aaram Yun

Abstract: We prove the security of NMAC, HMAC, AMAC, and the cascade construction with fixed input-length as quantum-secure pseudo-random functions (PRFs). Namely, they are indistinguishable from a random oracle against any polynomial-time quantum adversary that can make quantum superposition queries. In contrast, many blockcipher-based PRFs including CBC-MAC were recently broken by quantum superposition attacks.

Classical proof strategies for these constructions do not generalize to the quantum setting, and we observe that they sometimes even fail completely (e.g., the universal-hash then PRF paradigm for proving security of NMAC). Instead, we propose a direct hybrid argument as a new proof strategy (both classically and quantumly). We first show that a quantum-secure PRF is secure against key-recovery attacks, and remains secure under random leakage of the key. Next, as a key technical tool, we extend the oracle indistinguishability framework of Zhandry in two directions: we consider distributions on functions rather than strings, and we also consider a relative setting, where an additional oracle, possibly correlated with the distributions, is given to the adversary as well. This enables a hybrid argument to prove the security of NMAC. Security proofs for other constructions follow similarly.

Category / Keywords: foundations / cascade construction, NMAC, HMAC, augmented cascade, AMAC, PRF domain extension, quantum query, quantum security, post-quantum cryptography

Original Publication (with major differences): IACR-CRYPTO-2017

Date: received 1 Jun 2017

Contact author: aaramyun at unist ac kr

Available format(s): PDF | BibTeX Citation

Version: 20170602:164010 (All versions of this report)

Short URL: ia.cr/2017/509

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]