Skip to main content
SpringerLink
Log in

A new class of splitting 3-designs

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Splitting t-designs were first formulated by Huber in recent investigation of optimal (t − 1)-fold secure splitting authentication codes. In this paper, we investigate the construction and existence of splitting t-designs t-(v, u × k, 1) splitting designs and, show that there exists a 3-(v, 3 × 2, 1) splitting design if and only if v ≡ 2 (mod 8). As its application, we obtain a new infinite class of optimal 2-fold secure splitting authentication codes.

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. Blundo C., De Santis A., Kurosawa K., Ogata W.: On a fallacious bound for authentication codes. J. Cryptol. 12, 155–159 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. De Soete M.: New bounds and constructions for authentication/secrecy codes with splitting. J. Cryptol. 3, 173–186 (1991)

    MathSciNet  MATH  Google Scholar 

  3. Du B.: Splitting balanced incomplete block designs with block size 3 × 2. J. Comb. Des. 12, 404–420 (2004)

    Article  MATH  Google Scholar 

  4. Du B.: Splitting balanced incomplete block designs. Australas. J. Comb. 31, 287–298 (2005)

    MATH  Google Scholar 

  5. Ge G., Miao Y., Wang L.: Combinatorial constructions for optimal splitting authentication codes. SIAM J. Discrete Math. 18, 663–678 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hartman A.: The fundamental construction for 3-designs. Discrete Math. 124, 107–132 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Huber M.: Combinatorial bounds and characterizations of splitting authentication codes. Cryptogr. Commun. doi:10.1007/s12095-010-0020-4.

  8. Liang M., Du B.: Splitting balanced incomplete block designs with block size 2 × 4. J. Comb. Math. Comb. Comput. 63, 159–172 (2007)

    MathSciNet  MATH  Google Scholar 

  9. Mohácsy H., Ray-Chaudhuri D.K.: Candelabra systems and designs. J. Stat. Plann. Infer. 106, 419–448 (2002)

    Article  MATH  Google Scholar 

  10. Ogata W., Kurosawa K., Stinson D.R., Saido H.: New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discrete Math. 279, 383–405 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Wang J.: A new class of optimal 3-splitting authentication codes. Des. Codes Cryptogr. 38, 373–381 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Miao Liang

  2. Department of Mathematics, Suzhou University, Suzhou, 215006, People’s Republic of China

    Beiliang Du

Authors
  1. Miao Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Beiliang Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Beiliang Du.

Additional information

Communicated by C. J. Colbourn.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liang, M., Du, B. A new class of splitting 3-designs. Des. Codes Cryptogr. 60, 283–290 (2011). https://doi.org/10.1007/s10623-010-9433-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-010-9433-5

Keywords

Mathematics Subject Classification (2000)

Search

Navigation