Multiround Unconditionally Secure Authentication

Authentication codes are used to protect communication against a malicious adversary. In this paper we investigate unconditionally secure multiround authentication schemes. In a multiround scheme a message is authenticated by passing back and forth several codewords between the sender and receiver. We define a multiround authentication model and show how to calculate the probability of a successful attack for this model. We prove the security for a 3-round scheme and give a construction for the 3-round scheme based on Reed-Solomom codes. This construction has a very small key size for even extremely large messages. Furthermore, a secure scheme for an arbitrary number of rounds is given. We give a new upper bound for the keys size of an n-round scheme.

[1]  Rolf Johannesson,et al.  Strengthening Simmons' bound on impersonation , 1991, IEEE Trans. Inf. Theory.

[2]  Christian Gehrmann,et al.  Secure Multiround Authentication Protocols , 1995, EUROCRYPT.

[3]  Thomas Johansson,et al.  On Families of Hash Functions via Geometric Codes and Concatenation , 1993, CRYPTO.

[4]  Gustavus J. Simmons,et al.  A survey of information authentication , 1988, Proc. IEEE.

[5]  Gustavus J. Simmons,et al.  Contemporary Cryptology: The Science of Information Integrity , 1994 .

[6]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[7]  L. Tombak,et al.  Authentication codes in plaintext and chosen-content attacks , 1996 .

[8]  Thomas Johansson,et al.  On the cardinality of systematic authentication codes via error-correcting codes , 1996, IEEE Trans. Inf. Theory.

[9]  Thomas Johansson,et al.  Contributions to unconditionally secure authentication , 1994 .

[10]  Moni Naor,et al.  Codes for Interactive Authentication , 1994, CRYPTO.

[11]  Mihir Bellare,et al.  The Security of Cipher Block Chaining , 1994, CRYPTO.

[12]  T. Johansson,et al.  e Cardinality of Systematic Au odes Via Error-Correcting , 1996 .

[13]  Tor Helleseth,et al.  Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings , 1996, CRYPTO.

[14]  Christian Gehrmann,et al.  Cryptanalysis of the Gemmell and Naor Multiround Authentication Protocol , 1994, CRYPTO.

[15]  Douglas R. Stinson,et al.  Universal hashing and authentication codes , 1991, Des. Codes Cryptogr..

[16]  Christian Gehrmann,et al.  Fast Message Authentication Using Efficient Polynomial Evaluation , 1997, FSE.

[17]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[18]  Phillip Rogaway.  Bucket Hashing and its Application to Fast Message Authentication , 1995, CRYPTO.

[19]  Thomas Johansson,et al.  On the Relation between A-Codes and Codes Correcting Independent Errors , 1994, EUROCRYPT.

[20]  Gustavus J. Simmons,et al.  Authentication Theory/Coding Theory , 1985, CRYPTO.

[21]  Mustafa Atici,et al.  Universal Hashing and Multiple Authentication , 1996, CRYPTO.

[22]  F. MacWilliams,et al.  Codes which detect deception , 1974 .