Near optimal unconditionally secure authentication

  • Richard Taylor
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 950)


An efficient unconditionally secure authentication scheme with arbitration is presented which is also secure against attacks by the arbiter. Arguments are presented that suggest this scheme is almost optimal with respect to codeword lengths, and when many messages are sent the amount of key data per message approaches, at worst, 1/3 more than the best possible. An improved unconditionally secure authentication scheme without arbitration is also briefly presented.


  1. [1]
    Y. Desmedt and M. Yung. Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected against Arbiter's Attacks. Advances in Cryptology — CRYPTO '90, proceedings, Springer-Verlag 1991, pp. 177–188.Google Scholar
  2. [2]
    E. Gilbert, F. MacWilliams, and N. Sloane. Codes which detect deception. The BELL System Technical Journal, 53(3), pp. 405–424, March 1974.MathSciNetGoogle Scholar
  3. [3]
    ISO/IEC 9797. Data cryptographic techniques-Data integrity mechanism using a cryptographic check function employing a block cipher algorithm, International Organisation for Standardisation, 1989.Google Scholar
  4. [4]
    H. J. Knobloch. A Smart Card Implementation of the Fiat-Shamir Identification Scheme, Advances in Cryptology-EUROCRYPT '88, proceedings, Springer-Verlag 1989, pp. 87–96.Google Scholar
  5. [5]
    R. L. Rivest, A. Shamir, and L. Adleman. A method of obtaining digital Signatures and public key cryptosystems. Commun. ACM, 21, pp. 294–299, April 1978.CrossRefMathSciNetGoogle Scholar
  6. [6]
    G. J. Simmons. Message authentication with arbitration of transmitter/receiver disputes. Advances in Cryptology — EUROCRYPT '87, proceedings, Springer-Verlag 1988, pp. 151–165.Google Scholar
  7. [7]
    G. J. Simmons. A cartesian product construction for unconditionally secure authentication codes that permit arbitration. Journal of Cryptology, 2(2), pp. 77–104, 1990.MATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    G. J. Simmons. A survey of information Authentication, Contemporary Cryptology — The Science of Information Integrity, 1991, pp. 379–419. IEEE Press, New York.Google Scholar
  9. [9]
    M. N. Wegman and J. L. Carter. New Hash Functions and Their Use in Authentication and Set Equality, Journal of Computer and System Sciences 22, 1981, pp. 265–279.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Richard Taylor
    • 1
  1. 1.Telematic and System SecurityTelecom Australia Research LaboratoriesClayton VictoriaAustralia

Personalised recommendations