Welcome to the resource topic for 2004/309
Title:
The Power of Verification Queries in Message Authentication and Authenticated Encryption
Authors: Mihir Bellare, Oded Goldreich, Anton Mityagin
Abstract:This paper points out that, contrary to popular belief,
allowing a message authentication adversary multiple verification attempts
towards forgery is NOT equivalent to allowing it a single one, so that
the notion of security that most message authentication schemes are proven to
meet does not guarantee their security in practice. We then show, however, that
the equivalence does hold for STRONG unforgeability. Based on this we
recover security of popular classes of message authentication schemes such as
MACs (including HMAC and PRF-based MACs) and CW-schemes. Furthermore, in many
cases we do so with a TIGHT security reduction, so that in the end
the news we bring is surprisingly positive given the initial negative result.
Finally, we show analogous results for authenticated encryption.
ePrint: https://eprint.iacr.org/2004/309
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 .