This paper proposes an authenticated encryption scheme, called SIVx, that preserves BBB security also in the case of unlimited nonce reuses. For this purpose, we propose a single-key BBB-secure message authentication code with 2n-bit outputs, called PMAC2x, based on a tweakable block cipher. PMAC2x is motivated by PMAC TBC1k by Naito; we revisit its security proof and point out an invalid assumption. As a remedy, we provide an alternative proof for our construction, and derive a corrected bound for PMAC TBC1k.
CITATION STYLE
List, E., & Nandi, M. (2017). Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10159, pp. 258–274). Springer Verlag. https://doi.org/10.1007/978-3-319-52153-4_15
Mendeley helps you to discover research relevant for your work.