A new class of 3-fold perfect splitting authentication codes

Restricted strong partially balanced t-designs were first formulated by Pei, Li, Wang and Safavi-Naini in investigation of authentication codes with arbitration. In this article, we will prove that splitting authentication codes that are multi-fold perfect against spoofing can be characterized in terms of restricted strong partially balanced t-designs. We will also investigate the existence of restricted strong partially balanced 3-designs RSPBD 3-(v, b, 3 × 2; λ1, λ2, 1, 0)s, and show that there exists an RSPBD 3-(v, b, 3 × 2; λ1, λ2, 1, 0) for any $${v\equiv 9\ (\mbox{{\rm mod}}\ 16)}$$ . As its application, we obtain a new infinite class of 3-fold perfect splitting authentication codes.

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

[2]  Beiliang Du,et al.  A new class of splitting 3-designs , 2011, Des. Codes Cryptogr..

[3]  Haim Hanani,et al.  On Quadruple Systems , 1960, Canadian Journal of Mathematics.

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

[5]  Alan Hartman,et al.  The fundamental construction for 3-designs , 1994, Discret. Math..

[6]  Charles C. Lindner,et al.  Steiner Quadruple Systems , 2008 .

[7]  Jinhua Wang.  A new class of optimal 3-splitting authentication codes , 2007, Des. Codes Cryptogr..

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

[9]  Hedvig Mohácsy,et al.  Candelabra systems and designs , 2002 .

[10]  Jinhua Wang,et al.  Further Results on the Existence of Splitting BIBDs and Application to Authentication Codes , 2010 .

[11]  Dingyi Pei,et al.  Authentication codes and combinatorial designs , 2005 .

[12]  Lijun Ji.  An improvement on H design , 2009 .

[13]  Dingyi Pei,et al.  Authentication Codes and Combinatorial Designs (Discrete Mathematics and Its Applications) , 2006 .

[14]  Michael Huber.  Combinatorial bounds and characterizations of splitting authentication codes , 2010, Cryptography and Communications.

[15]  Beiliang Du.  Splitting balanced incomplete block designs , 2005, Australas. J Comb..

[16]  Hui Zhang,et al.  Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order , 2010, Adv. Math. Commun..

[17]  Dingyi Pei.  Information-theoretic bounds for authentication codes and block designs , 2004, Journal of Cryptology.

[18]  Reihaneh Safavi-Naini,et al.  Characterization of Optimal Authentication Codes with Arbitration , 1999, ACISP.