论文信息 - A Uniied and Generalized Treatment of Authentication Theory

A Uniied and Generalized Treatment of Authentication Theory

This paper provides a uniied and generalized treatment of information-theoretic lower bounds on an opponent's probability of cheating in one-way message authentication. It extends and generalizes, in a number of directions, the substantial body of known results, each of which holds only for a certain restricted scenario. At the same time the treatment of unconditionally-secure authentication is simpliied considerably.

U. Maurer

[1] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

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

[3] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[4] Viiveke Fåk. Repeated use of codes which detect deception (Corresp.) , 1979, IEEE Trans. Inf. Theory.

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

[6] Richard E. Blahut,et al. Principles and practice of information theory , 1987 .

[7] Andrea Sgarro,et al. Informational Divergence Bounds for Authentication Codes , 1990, EUROCRYPT.

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

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

[10] Thomas Johansson. Lower bounds on the probability of deception in authentication with arbitration , 1994, IEEE Trans. Inf. Theory.

[11] Ben J. M. Smeets. Bounds on the probability of deception in multiple authentication , 1994, IEEE Trans. Inf. Theory.