论文信息 - A new class of optimal 3-splitting authentication codes

A new class of optimal 3-splitting authentication codes

The necessary condition for the existence of a (?, 3× 3,1)-splitting BIBD is ? ? 1 (mod 54). In this paper, we show that the necessary condition is also sufficient with one possible exception of ? = 55. As its application, we obtain a new infinite class of optimal 3-splitting authentication codes.

Jinhua Wang

[1] Gennian Ge,et al. On group-divisible designs with block size four and group-type 6um1 , 2004, Discret. Math..

[2] Kaoru Kurosawa,et al. New Bound on Authentication Code with Arbitration , 1994, CRYPTO.

[3] G. Ge,et al. On Group-Divisible Designs with Block Size Four and Group-Type gum1 , 2002, Des. Codes Cryptogr..

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

[5] Kaoru Kurosawa,et al. New combinatorial designs and their applications to authentication codes and secret sharing schemes , 2004, Discret. Math..

[6] Gennian Ge,et al. Combinatorial Constructions for Optimal Splitting Authentication Codes , 2005, SIAM J. Discret. Math..

[7] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[8] Gustavus J. Simmons,et al. A cartesian product construction for unconditionally secure authentication codes that permit arbitration , 1990, Journal of Cryptology.

[9] Beiliang Du. Splitting balanced incomplete block designs with block size 3 × 2 , 2004 .

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

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