On Security of Universal Hash Function Based Multiple Authentication
2012 (English)In: Lecture Notes in Computer Science, Vol. 7618 / [ed] Chim, Tat Wing and Yuen, Tsz Hon, 2012, 303-310 p.Conference paper (Refereed)
Universal hash function based multiple authentication was originally proposed by Wegman and Carter in 1981. In this authentication, a series of messages are authenticated by first hashing each message by a fixed (almost) strongly universal$_2$ hash function and then encrypting the hash value with a preshared one-time pad. This authentication is unconditionally secure. In this paper, we show that the unconditional security cannot be guaranteed if the hash function output for the first message is not encrypted, as remarked in [Atici and Stinson, CRYPTO '96. LNCS, vol. 1109]. This means that it is not only sufficient, but also necessary, to encrypt the hash of every message to be authenticated in order to have unconditional security. The security loss is demonstrated by a simple existential forgery attack.
Place, publisher, year, edition, pages
2012. 303-310 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 7618
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-84732DOI: 10.1007/978-3-642-34129-8_27ISBN: 978-3-642-34128-1 (print)ISBN: 978-3-642-34129-8 (online)OAI: oai:DiVA.org:liu-84732DiVA: diva2:561456
14th International Conference on Information and Communications Security, ICICS 2012, Hong Kong, China, October 29-31, 2012