Skip to main content
SpringerLink
Log in

A New Class of Optimal 3-splitting Authentication Codes

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

An Erratum to this article was published on 12 October 2007

Abstract

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.

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. C. J. Colbourn J. H. Dinitz (Eds) (1996) The CRC Handbook of Combinatorial Designs CRC Press Boca Raton, FL

    Google Scholar 

  2. B. Du (2004) ArticleTitleSplitting balanced incomplete block designs with block size 3× 2 J. Combin. Des. 12 404–420 Occurrence Handle10.1002/jcd.20025 Occurrence Handle1057.05009 Occurrence Handle2005f:05014

    Article  MATH  MathSciNet  Google Scholar 

  3. G. Ge R. Rees (2004) ArticleTitleOn group divisible designs with block size four and group type 6um1 Discrete Math. 279 247–265 Occurrence Handle2005g:05024

    MathSciNet  Google Scholar 

  4. T. Johansson (1994) ArticleTitleLower bound on the probability of deception in authentication with arbitration IEEE Trans. Inform. Theory 40 1573–1585 Occurrence Handle10.1109/18.333869 Occurrence Handle0814.94012 Occurrence Handle95g:94015

    Article  MATH  MathSciNet  Google Scholar 

  5. K. Kurosawa (1994) ArticleTitleNew bound on authentication codes with arbitration, in Proc. CRYPTO’94 Lecture Notes in Comput. Sci. 839 140–149 Occurrence Handle0939.94568 Occurrence Handle1316407

    MATH  MathSciNet  Google Scholar 

  6. G. Ge Y. Miao L. Wang (2005) ArticleTitleCombinatorial constructions for optimal splitting authentication codes SIAM J. Discrete Math. 18 663–678 Occurrence Handle10.1137/S0895480103435469 Occurrence Handle2157817

    Article  MathSciNet  Google Scholar 

  7. W. Ogata K. Kurosawa D. R. Stinson H. Saido (2004) ArticleTitleNew combinatorial designs and their applications to authentication codes and secret sharing schemes Discrte Math. 279 383–405 Occurrence Handle2005e:05020

    MathSciNet  Google Scholar 

  8. G. J. Simmons (1985) ArticleTitleAuthentication theory/ decoding theory, in Proc. CRYPTO’84 Lecture Notes in Comput. Sci. 196 411–431 Occurrence Handle0575.94011

    MATH  Google Scholar 

  9. G. J. Simmons (1988) ArticleTitleMessage authentication with arbitration of transmitter/receiver disputes, in Proc. EUROCRYPTO’87 Lecture Notes in Comput. Sci. 304 150–165

    Google Scholar 

  10. G. J. Simmons (1990) ArticleTitleA Cartesian product construction for unconditionally secure authentication codes that permit arbitration J. Cryptol. 2 77–104 Occurrence Handle10.1007/BF00204449 Occurrence Handle0701.94008 Occurrence Handle92d:94021

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Sciences, Nantong University, Nantong, 226007, P.R. China

    Jinhua Wang

Authors
  1. Jinhua Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinhua Wang.

Additional information

Communicated by: V. Zinoviev

AMS Classification: 05B05, 94A62

An erratum to this article is available at http://dx.doi.org/10.1007/s10623-007-9104-3.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, J. A New Class of Optimal 3-splitting Authentication Codes. Des Codes Crypt 38, 373–381 (2006). https://doi.org/10.1007/s10623-005-1501-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-005-1501-x

Keywords

Search

Navigation