论文信息 - Characterization of Optimal Authentication Codes with Arbitration

Characterization of Optimal Authentication Codes with Arbitration

In this paper we study authentication codes with arbitration (A2-codes). An A2-code is called optimal if its cheating probabilities achieve their information-theoretic lower bounds, and has minimum number of keys. We give characterization of optimal A2 -codes in terms of combinatorial designs. This means that construction of optimal A2- codes is reduced to the construction of the corresponding combinatorial structures.

Reihaneh Safavi-Naini | Dingyi Pei | Yejing Wang | Yuqiang Li

[1] Thomas Johansson,et al. On the Construction of Perfect Authentication Codes that Permit Arbitration , 1993, CRYPTO.

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

[3] Satoshi OBANA,et al. A2-code = Affine resolvable = BIBD , 1997, ICICS.

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

[5] David Chaum,et al. Advances in Cryptology — EUROCRYPT’ 87 , 2000, Lecture Notes in Computer Science.

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

[7] Douglas R. Stinson,et al. Advances in Cryptology — CRYPTO’ 93 , 2001, Lecture Notes in Computer Science.

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

[9] Reihaneh Safavi-Naini,et al. Combinatorial Structure of A-codes with r-fold Security , 1994, ASIACRYPT.

[10] Tsutomu Matsumoto,et al. Incidence structures for key sharing , 1995 .