On A2-codes including arbiter's attacks

  • Thomas Johansson
  • Ben Smeets
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 950)


We comment on the work by R. Taylor presented at Euro-Crypt'94 (see this proceedings). We first extend some known results on authentication codes with arbitration to the case when protection against arbiter's attacks is provided. We give lower bounds on the secret key size for each participant and give a construction showing that these bounds are tight. These results improve upon previously known work and show that a claim in the aforementioned paper is wrong.


  1. 1.
    G.J. Simmons, “A survey of Information Authentication”, in Contemporary Cryptology, The science of information integrity, ed. G.J. Simmons, IEEE Press, New York, 1992.Google Scholar
  2. 2.
    G.J. Simmons, “A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration”, in Journal of Cryptology, Vol. 2, no. 2, 1990, pp. 77–104.MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Y. Desmedt, M. Yung, “Asymmetric and Securely-Arbitrated Unconditional Authentication Systems”, submitted to IEEE Transactions on Information Theory. A part of this paper was presented at Crypto'90.Google Scholar
  4. 4.
    T. Johansson, “Lower Bounds on the Probability of Deception in Authentication with Arbitration”, in Proceedings of 1993 IEEE International Symposium on Information Theory, San Antonio, USA, January 17–22, 1993, p. 231., to be published in IEEE Trans, on Information Theory.Google Scholar
  5. 5.
    T. Johansson, “On the construction of perfect authentication codes that permit arbitration”, Proceedings Crypto'93, pp. 343–354.Google Scholar
  6. 6.
    E.F. Brickell D.R. Stinson, “Authentication codes with multiple arbiters”, in Proceedings of Eurocrypt '88, C.G Günter, Ed., Davos, Switzerland, May 25–27, 1988, pp. 51–55, Berlin: Springer-Verlag, 1988.Google Scholar
  7. 7.
    R. Taylor, “Near Optimal Unconditionally Secure Authentication”, presented at Eurocrypt'94, in Pre-proceedings of Eurocrypt'94, pp. 245–256.Google Scholar
  8. 8.
    T. Johansson, G. Kabatianskii, B. Smeets, “On the relation between A-codes and codes correcting independent errors” Proceedings Eurocrypt'93, pp. 1–11.Google Scholar
  9. 9.
    B. den Boer, “A simple and key-economical unconditionally authentication scheme”, J. Computer Security, Vol. 2, 1993, pp. 65–71.Google Scholar
  10. 10.
    Bierbrauer, Johansson, Kabatianskii, Smeets, “On the construction of universal families of hash functions via geometric codes and concatenation”, Proceedings of Crypto 93, Santa Barbara, USA, 1993, pp. 331–342.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Thomas Johansson
    • 1
  • Ben Smeets
    • 1
  1. 1.Dept. of Information TheoryUniversity of LundLundSweden

Personalised recommendations