Skip to main content
SpringerLink
Log in

A construction of t-fold perfect splitting authentication codes with equal deception probabilities

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

Orthogonal multi-arrays were first formulated by Brickell in investigation of authentication codes. In this article, we will prove that t-fold perfect splitting authentication codes with equal deception probabilities can be characterized in terms of orthogonal multi-arrays. We will also investigate the existence of orthogonal multi-arrays, and show that the existence of orthogonal multi-arrays OMA (t,k×c,n)s is equivalent to the existence of transversal splitting t-designs splitting TD (t,k×c,n)s. Further, we obtain some new infinite classes of t-fold perfect splitting authentication codes with equal deception probabilities.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abel, R.J.R.: Existence of five MOLS of order 18 and 60. J. Combin. Designs. doi:10.1002/jcd.21384

  2. Abel, R.J.R., Colbourn, C.J., Dinitz, J.H.: Mutually Orthogonal Latin Squares (MOLS). In: Colbourn, C.J., Dinitz, J.H., Dinitz, J.H. (eds.) The CRC Handbook, pp. 160–192. CRC Press, Boca Raton (2007)

    Google Scholar 

  3. Brickell, E.F.: A few results in message authentication. Congr. Numer. 43, 141–154 (1984)

    MathSciNet  Google Scholar 

  4. Bush, K.A.: Orthogonal arrays of index unity. Ann. Math. Stat. 23, 293–295 (1952)

    Google Scholar 

  5. Chee, Y.M., Zhang, X., Zhang, H.: Infinite families of optimal authentication codes secure against spoofing attacks of highter order. Adv. Math. Commun. 5, 59–68 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  6. Huber, M.: Combinatorial bounds and characterizations of splitting authentication codes. Crypt. Commun. 2, 173–185 (2010)

    Article  MATH  Google Scholar 

  7. Ji, L., Yin, J.: Constructions of new orthogonal arrays and covering arrays of strength three. J. Combin. Theory, Ser. A 117, 23–33 (2010)

    Article  MathSciNet  Google Scholar 

  8. Liang, M.: Combinatorial Constructions for Authentication Codes. PhD thesis, Suzhou University (2012)

  9. Liang, M., Du, B.A: new class of splitting 3-designs. Des. Codes Crypt. 60, 283–290 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  10. Liang, M., Du, B.A: new class of 3-fold perfect splitting authentication codes. Des. Codes Crypt. 62, 109–119 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  11. Mills, W.H.: On the existence of H designs. Congr. Numer. 79, 129–141 (1990)

    MATH  MathSciNet  Google Scholar 

  12. Pei, D.: Information-theoretic bounds for authentication codes and block designs. J. Crypt. 8, 177–188 (1995)

    Article  MATH  Google Scholar 

  13. Pei, D.: Authentication Codes and Combinatorial Designs. ChapmanHall/CRC, Boca Raton (2006)

    MATH  Google Scholar 

  14. Simmons, G.J.: A game theory model of digital message authentication. Congr. Numer. 34, 413–424 (1982)

    MathSciNet  Google Scholar 

  15. Todorov, D.T.: Four Mutually Orthogonal Latin Squares of order 14. J. Combin. Designs 22, 363–364 (2012)

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Grant No. 11171248, 11301370).

Author information

Authors and Affiliations

  1. College of Science, Hebei University of Engineering, Handan, 056038, People’s Republic of China

    Mingchao Li & Beiliang Du

  2. Foundation Department, Suzhou Vocational University, Suzhou, 215104, People’s Republic of China

    Mingchao Li

  3. Department of Mathematics, Soochow University (Suzhou University), Suzhou, 215006, People’s Republic of China

    Miao Liang

Authors
  1. Mingchao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miao Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Beiliang Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Beiliang Du.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, M., Liang, M. & Du, B. A construction of t-fold perfect splitting authentication codes with equal deception probabilities. Cryptogr. Commun. 7, 207–215 (2015). https://doi.org/10.1007/s12095-014-0107-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-014-0107-4

Keywords

Mathematics Subject Classification (2010)

Search

Navigation