Skip to main content
SpringerLink
Log in

Combinatorial characterizations of authentication codes

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

Abstract

In this paper, we prove two new combinatorial characterizations of authentication codes. Authentication codes without secrecy are characterized in terms of orthogonal arrays; and general authentication codes are characterized in terms of balanced incomplete block designs. In both of these characterizations, it turns out that encoding rules must be equiprobable; in the second characteriztion, the source states must also be equiprobable.

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. Brickell, E.F. 1984. A few results in message authentication. Congressus Numerantium, 43:141–154.

    Google Scholar 

  2. De Soete, M. 1988. Some constructions for authentication - secrecy codes. Lecture Notes in Computer Science, 330:57–75.

    Google Scholar 

  3. De Soete, M. 1991. New bounds and constructions for authentication/secrecy codes with splitting. Journal of Cryptology, 3:173–186.

    Google Scholar 

  4. De Soete, M., Vedder, K., and Walker, M. 1990. Cartesian authentication schemes. Lectures Notes in Computer Science 434:476–490.

    Google Scholar 

  5. Massey, J.L. 1986. Cryptography—a selective survey. In Digital Communications, Amsterdam: North-Holland, pages 3–21.

    Google Scholar 

  6. Simmons, G.J. 1984. Message authentication: a game on hypergraphs. Congressus Numerantium, 45:161–192.

    Google Scholar 

  7. Simmons, G.J. 1985. Authentication theory/coding theory. Lecture Notes in Comp. Sci., 196:411–432.

    Google Scholar 

  8. Stinson, D.R. 1987. Some constructions and bounds for authentication codes. Journal of Cryptology, 1:37–51, 1988, preliminary version appeared in Lectures Notes in Computer Science, 263:418–425.

    Google Scholar 

  9. Stinson, D.R. 1990. The combinatorics of authentication and secrecy codes. Journal of Cryptology, 2:23–49.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering Department, University of Nebraska, 68588-0115, Lincoln, NE, USA

    D. R. Stinson

  2. Center for Communication and Information Science, University of Nebraska, 68588-0115, Lincoln, NE, USA

    D. R. Stinson

Authors
  1. D. R. Stinson
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by R.C. Mullin

A preliminary version of this paper appeared in “Advances in Cryptology—CRYPTO '91 Proceedings” Lecture Notes in Computer Science 576 (1992) 62–73, Springer-Verlag.

Research supported by NSERC grant A9287.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stinson, D.R. Combinatorial characterizations of authentication codes. Des Codes Crypt 2, 175–187 (1992). https://doi.org/10.1007/BF00124896

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00124896

Keywords

Search

Navigation