论文信息 - Lower bounds on the probability of deception in authentication with arbitration

Lower bounds on the probability of deception in authentication with arbitration

The paper investigates a model for authentication in which not only an outsider, but also the transmitter or the receiver, may cheat. Lower bounds on the probability of success for different types of deception as well as on the parameters of secure authentication codes are derived. The latter bounds are shown to be tight by demonstrating codes in projective space that meet the bounds with equality. >

Thomas Johansson

[1] Moti Yung,et al. Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract) , 1990, CRYPTO.

[2] Ernest F. Brickell,et al. Authentication Codes with Multiple Arbiters (Extended Abstract) , 1988, EUROCRYPT.

[3] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .

[4] Y Desmedt,et al. ARBITRATED UNCONDITIONALLY SECURE AUTHENTICATION CAN BE UNCONDITIONALLY PROTECTED AGAINST ARBITER ATTACKS , 1991, CRYPTO 1991.

[5] R. Gallager. Information Theory and Reliable Communication , 1968 .

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

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

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

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

[10] I. Csiszár. Information Theory , 1981 .

[11] Gustavus J. Simmons,et al. Message Authentication with Arbitration of Transmitter/Receiver Disputes , 1987, EUROCRYPT.

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

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