Multi User Security of LightMAC and LightMAC_Plus

ePrint Report: Multi User Security of LightMAC and LightMAC_Plus

Nilanjan Datta, Shreya Dey, Avijit Dutta, Devdutto Kanungo

In FSE'16, Luykx et al. have proposed $\textsf{LightMAC}$ that provably achieves a query length independent PRF security bound. To be precise, the construction achieves security roughly in the order of $O(q^2/2^n)$, when instantiated with two independently keyed $n$-bit block ciphers and $q$ is the total number of queries made by the adversary. Subsequently, in ASIACRYPT'17, Naito proposed a beyond-birthday-bound variant of the $\textsf{LightMAC}$ …

construction eprint report fse length order query report security user security