Welcome to the resource topic for 2013/792
Title:
Improved Authenticity Bound of EAX, and Refinements
Authors: Kazuhiko Minematsu, Stefan Lucks, Tetsu Iwata
Abstract:EAX is a mode of operation for blockciphers to implement an authenticated encryption. The original paper of EAX proved that EAX is unforgeable up to O(2^{n/2}) data with one verification query. However, this generally guarantees a rather weak bound for the unforgeability under multiple verification queries, i.e., only (2^{n/3}) data is acceptable. This paper provides an improvement over the previous security proof, by showing that EAX is unforgeable up to O(2^{n/2}) data with multiple verification queries. Our security proof is based on the techniques appeared in a paper of FSE 2013 by Minematsu et al. which studied the security of a variant of EAX called EAX-prime. We also provide some ideas to reduce the complexity of EAX while keeping our new security bound. In particular, EAX needs three blockcipher calls and keep them in memory as a pre-processing, and our proposals can effectively reduce three calls to one call. This would be useful when computational power and memory are constrained.
ePrint: https://eprint.iacr.org/2013/792
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .