Lower Bounds on the Probability of Deception in Authentication with Arbitration

IEEE Transactions on Information Theory

Volumn 40, Issue 5, 1994, Pages 1573-1585

  Johansson, Thomas ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

arbitration; Authentication; authentication codes; information theoretic bounds; unconditional security

Indexed keywords

CODES (SYMBOLS); CONFORMAL MAPPING; GEOMETRY; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES; SECURITY OF DATA; SIGNAL ENCODING; TRANSCEIVERS;

AUTHENTICATION CODES; INFORMATION THEORETIC BOUNDS; UNCONDITIONAL SECURITY;

INFORMATION THEORY;

EID: 0028514178     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.333869     Document Type: Article

References (14)

1. E. N. Gilbert, F. J. MacWilliams, and N. J. A. Sloane, “Codes which detect deception,” Bell Syst. Tech. J., vol. 53, pp. 405-424, 1974.
2. G. J. Simmons, “Authentication theory/coding theory,” in Advances in Cryptology, Proc. CRYPTO 84, G. R. Blakley and D. Chaum, Eds., Lecture Notes in Computer Science, Vol. 196. New York: Springer, 1985, pp. 411-431.
3. J. L. Massey, “Contemporary cryptology, an introduction,” in Contemporary Cryptology, The Science of Information Integrity, G. J. Simmons, Ed. New York: IEEE Press, 1991, pp. 3-39.
4. G. J. Simmons, “A Cartesian product construction for unconditionally secure authentication codes that permit arbitration,” J. Cryptology, vol. 2, no. 2, pp. 77-104, 1990.
5. —, “Message authentication with arbitration of transmitter/receiver disputes,” in Proc. Eurocrypt '87, Amsterdam, The Netherlands, April 13-15, 1987, D. Chaum and W. L. Price, Eds. Berlin: Springer-Verlag, 1988, pp. 151-165.
6. R. G. Gallager, Information Theory and Reliable Communications. New York: Wiley, 1968.
7. E. F. Brickell and D. R. Stinson, “Authentication codes with multiple arbiters,” in Proc. Eurocrypt '88, Davos, Switzerland, May 25-27, 1988, C. G. Gunter, Ed. Berlin: Springer-Verlag, 1988, pp. 51-55.
8. Y. Desmedt and M. Yung, “Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter's attack,” in Proc. Crypto '90. Berlin: Springer-Verlag, pp. 177-188.
9. R. Johannesson and A. Sgarro, “Strengthening Simmons' bound on Impersonation,” in IEEE Trans. Inform. Theory, vol. 37, pp. 1182-1185, July 1991.
10. I. Csiszar and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981, p. 48.
11. B. Smeets, “Bounds on the probability of deception in multiple authentication,” IEEE Trans. Inform. Theory, see this issue.
12. Z.-X. Wan, Geometry of Classical Groups over Finite Fields. Lund: Studentlitteratur, 1993.
13. T. Johansson, G. Kabatianskii, and B. Smeets, “On the relation between A -codes and codes correcting independent errors,” in Proc. Eurocrypt '93, Berlin: Springer-Verlag, 1994, pp. 1-11.
14. W. Feller, An introduction to Probability Theory and Its Applications, Vol. 2. New York: Wiley, 1966, pp. 153-154.