Authentication codes that are r-fold secure against spoofing

ABSTRACT

In this paper we study authentication codes (A-codes) that are r-fold secure against spoofing. We obtain necessary and sufficient conditions for such codes and give a characterization of codes with a minimum number of encoding rules. We will show that if the source is uniform, A-codes that provide perfect protection against spoofing attack of order r are r-fold secure.

REFERENCES

• 1: J.L. Massey, Cryptography, a selective survey, Digital Communications, ed.E. Biglieri and G. Pratti, Elsevier Science Publ., North-Holland, (1986), 3-25.
• 2: D. R. Stinson, The combinatorics of authentication and secrecy codes, Journal of Cryptology, v.2 n.1, p.23-49, 1990 [doi>10.1007/BF02252868]
• 3: D. R. Stinson, Combinatorial characterizations of authentication codes, Designs, Codes and Cryptography, v.2 n.2, p.175-187, June 1992 [doi>10.1007/BF00124896]
• 4: J.H. Dinitz, D.R. Stinson, Contemporary Design Theory , John Wiley and Sons, Inc., New-York, 1992.
• 5: Reihaneh Safavi-Naini , L. Tombak, Authentication Codes under Impersonation Attack, Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, p.35-47, December 13-16, 1992
• 6: L. Tombak , Reihaneh Safavi-Naini, Authentication Codes with Perfect Protection, Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, p.15-26, December 13-16, 1992
• 7: R Safavi-Naini , L. Tombak, Optimal authentication systems, Workshop on the theory and application of cryptographic techniques on Advances in cryptology, p.12-27, January 1994, Lofthus, Norway
• 8: M. Soet, Some constructions for authentication-secrecy codes, Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88, p.57-76, April 1988, Davos, Switzerland
• 9: M. Walker, Information-theoretic bounds for authentication schemes, Journal of Cryptology, v.2 n.3, p.131-144, 1990
• 10: U. Rosenbaum, A lower bound on authentication after having observed a sequence of messages, 3outnaI of Ctyptology, 3, Vol 6, (1993), 135-156.
• 11: P. Schobi, Perfect authentication systems for data sources with arbitrary statistics, presented at Eurocrypt '86.

INDEX TERMS

Primary Classification:
  E. Data
  E.3 DATA ENCRYPTION

Additional Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.6 Security and Protection
          Subjects: Authentication

  E. Data

General Terms:
Security, Theory, Verification

Keywords:
r-fold security, authentication, authentication codes, computer security, cryptography