• Title of article

    Authentication codes and bipartite graphs

  • Author/Authors

    Feng، نويسنده , , Rongquan and Hu، نويسنده , , Lei and Kwak، نويسنده , , Jin Ho، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2008
  • Pages
    10
  • From page
    1473
  • To page
    1482
  • Abstract
    In this paper, a characterization of authentication codes in terms of bipartite graphs is given. By using such a characterization, two necessary and sufficient conditions for a minimal authentication code with perfect secrecy are derived. The probabilities of a successful impersonation and of a successful substitution attack are discussed. As a result, some (optimal) minimal authentication codes with perfect secrecy are constructed from association schemes, from finite groups or from known authentication codes no matter whether the known ones are with or without secrecy.
  • Journal title
    European Journal of Combinatorics
  • Serial Year
    2008
  • Journal title
    European Journal of Combinatorics
  • Record number

    1549644