Jun 9, 2021 · HMAC and NMAC are the most basic and important constructions to convert Merkle-Damgård hash functions into message authentication codes (MACs) ...
Aug 11, 2021 · We show that the tight bound of the number of quantum queries to distinguish HMAC or NMAC from a random function is in the quantum random oracle model.
Duration: 21:31
Posted: Aug 11, 2021
Posted: Aug 11, 2021
On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model · List of references · Publications that cite this publication.
People also ask
What is the difference between NMAC and HMAC?
Is HMAC quantum secure?
What is the quantum random oracle model?
Jan 12, 2024 · Quantum speed-up for multidimensional (zero correlation) ... On tight quantum security of HMAC and NMAC in the quantum random oracle model.
On tight quantum security of HMAC and NMAC in the quantum random oracle model. A Hosoyamada, T Iwata. Advances in Cryptology–CRYPTO 2021: 41st Annual ...
To give the tight quantum bound, based on an alternative formalization of Zhandry's compressed oracle technique, we introduce a new proof technique focusing on ...
[PDF] Succinct Arguments in the Quantum Random Oracle Model
www.semanticscholar.org › paper › Succ...
On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model ... model, where compression functions are modeled as quantum random oracles ...
On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model ... oracle proof implies security in the quantum-accessible random oracle model ...
Sep 20, 2017 · A tight security reduction in the quantum random oracle model for code-based signature schemes. Authors:André Chailloux, Thomas Debris-Alazard.
Missing: HMAC NMAC