A Natural Taxonomy for Digital Information Authentication Schemes

  • Gustavus J. Simmons
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 293)


There are two objectives that prompt the authentication of information; one is to verify that the information was, in all probability, actually originated by the pur- ported originator, i.e., source identification, the other is to verify the integrity of the information, i.e., to establish that even if the message was originated by the authorized source, that it hasn’t been subsequently altered, repeated, delayed, etc. These two objectives are normally treated in the theory of authentication as though they are inseparable, and will also be treated in that way here, although recent results by Cham [l] demonstrating message integrity with source anonymity and by Fiat and Shamir [Z], by Goldreich, Micali and Wigderson [3], and by others demon- strating verification of source identity with no additional information exchange show that the functions can in some instances be separated. The relevance of this comment to the subject matter of this paper is that it suggests that there may be a fourth independent coordinate in information authentication besides the three that will be discussed here. In spite of considerable effort, we have been unable to produce a convincing argument for or against this being the case, so we only mention the possibility for completeness.


Authentication Scheme Authentication Protocol Cipher Stream Authentication Code Message Authentication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    D. Chaum, “Security without identification: Transaction systems to make big brother obsolete,” Communications of the ACM, Vol. 28, Oct. 1985, pp. 1030–1044.CrossRefGoogle Scholar
  2. 2.
    A. Fiat and A. Shamir, “How to prove yourself: Practical solutions to identification and signature problems,” Presented at Crypto’86, Santa Barbara, CA, Aug. 11–15, 1986, pp. 18–1 thru 18–7 of the Conference Abstracts and Papers.Google Scholar
  3. 3.
    O. Goldreich, S. Micali and A. Wigderson, “Proofs that yield nothing but their validity and a methodology of cryptographic protocol design,” In The Computer Society of IEEE. 27th Annual Symp. on Foundations of Computer Science (FOCS), pp. 174–187, IEEE Computer Society Press (1986). Toronto, Ontario, Canada, Oct. 27–29. 1986.Google Scholar
  4. 4.
    P. D. Merillat, “Secure stand-alone positive personnel identity verification system (SSA-PPIV),” Sandia National Laboratories Tech. Rpt. SAND79-0070 (March).Google Scholar
  5. 5.
    G. J. Simmons, “A system for verifying user identity and authorization at the point-of-sale or access,” Cryptologia, Vol. 8, No. 1, January 1984, pp. 1–21.MathSciNetCrossRefGoogle Scholar
  6. 6.
    C. L. Henderson, A. M. Fine, “ Motion, intrusion and tamper detection for surveillance and containment,” Sandia National Laboratories Tech. Rpt. SAND79-0792 (March 1980).Google Scholar
  7. 7.
    G. J. Simmons, “ A game theory model of digital message authentication,” Congressus Numerantium 34 (1982), pp. 413–424.MathSciNetGoogle Scholar
  8. 8.
    G. J. Simmons, “Message authentication: A game on hypergraphs,” Proceedings of the 15th Southeastern Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, LA. March 5–8, 1984, pp. 161–192.Google Scholar
  9. 9.
    G. J. Simmons, “Authentication theory/coding theory,” Proceedings of Crypto’84, Santa Barbara, CA, August 19–22, 1984, in Advances in Cryptology, Ed. by R. Blakley, Springer-Verlag, Berlin (1985), pp. 411–432.CrossRefGoogle Scholar
  10. 10.
    G. J. Simmons, “The practice of authentication,” Proceedings of Eurocrypt’85, Linz, Austria, April 9–11, 1985, in Advances in Cryptology, ed. by Franz Pichler, Springer-Verlag, Berlin (1986), pp. 261–272.Google Scholar
  11. 11.
    E. N. Gilbert, E. J. MacWilliams, N.J.A. Sloane, “Codes which Detect Deception,” The Bell System Tech. Journal, Vol. 53, No. 3, March 1974, pp. 405–424.MathSciNetzbMATHGoogle Scholar
  12. 12.
    E. F. Brickell, “A Few Results in Message Authentication,” Proceedings of the 15th Southeastern Conference on Combinatorics. Graph Theory and Computing. Baton Rouge. LA. March 5–8. 1984. Congressus Numerantium, Vol. 43. Dec. 1984. pp. 141–154.MathSciNetGoogle Scholar
  13. 13.
    D. R. Stinson, “Some Constructions and Bounds for Authentication Codes,” presented at Crypto’86, Santa Barbara, CA, Aug. 12–15, 1986, to appear in Journal of Cryptology, 1987.Google Scholar
  14. 14.
    D. R. Stinson, “A Construction for Authentication/secrecy Codes from Certain Combinatorial Designs,” to appear in Journal of Cryptology.Google Scholar
  15. 15.
    Dept. of the Treasury Directive, “Electronic funds and securities transfer policy — message authentication,” Aug. 16, 1984, signed by Donald T. Regan, Secretary of the Treasury.Google Scholar
  16. 16.
    G. J. Simmons, “Verification of treaty compliance — revisited,” Proceedings of the IEEE Computer Society 1982 Symposium on Security and Privacy, Oakland, CA, Apr. 25–27 (1983), pp. 61–66.Google Scholar
  17. 17.
    G. J. Simmons, R. E. D. Stewart, P. A. Stokes, “Digital data authenticator,” Patent Application SD2654, S42640 (June 30, 1972).Google Scholar
  18. 18.
    C. H. Meyer and S. M. Matyas, Cryptography: A New Dimension in Computer Data Security, John Wiley & Sons, New York (1982).zbMATHGoogle Scholar
  19. 19.
    G. J. Simmons, “A Cartesian Product Construction for Authentication Codes that Permit Arbitration,” to appear in J. of Cryptology.Google Scholar
  20. 20.
    G. J. Simmons, “Authentication Codes that Permit Arbitration,” Proc. of the 18th Southeastern Conference on Combinatorics. Graph Theory and Computing, Boca Raton, FL, Feb. 23–27, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Gustavus J. Simmons
    • 1
  1. 1.Sandia National LaboratoriesAlbuquerque

Personalised recommendations