Abstract
This paper is a study of the combinatorics of unconditionally secure secrecy and authentication codes, under the assumption that each encoding rule is to be used for the transmission of some numberL of successive messages. We obtain bounds on the number of encoding rules required in order to obtain maximum levels of security. Some constructions are also given for codes which have the minimum number of encoding rules. These constructions use various types of combinatorial designs.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Th. Beth, D. Jungnickel, and H. Lenz,Design Theory, Bibliographisches Institut, Zurich, 1985.
E. F. Brickell, A few results in message authentication,Congr. Numer. 43 (1984), 141–154.
E. F. Brickell and D. R. Stinson, Authentication codes with multiple arbiters (Extended Abstract), inAdvances in Cryptology—EUROCRYPT '88, Lecture Notes in Computer Science, vol. 330, Springer-Verlag, Berlin, 1988, pp. 51–55.
G. Castagnoli, Comments on Massey's concepts of perfect secrecy and perfect authenticity,Alta Frequenza 51 (1987), 227–228.
M. De Soete, Some constructions for authentication—secrecy codes, inAdvances in Cryptology—EUROCRYPT '88, Lecture Notes in Computer Science, vol.330, Springer-Verlag, Berlin, 1988, pp. 57–75.
E. Gilbert, F. J. MacWilliams, and N. J. A. Sloane, Codes which detect deception,Bell System Tech. J. 53 (1974), 405–424.
A. Granville, A. Moisiadis, and R. Rees, Nested Steinern-gon systems and perpendicular arrays,J. Combin. Math. Combin. Comput. 3 (1988), 163–167.
H. Hanani, A class of three-designs,J. Combin. Theory Ser. A 26 (1979), 1–19.
E. S. Kramer, D. L. Kreher, R. Rees, and D. R. Stinson, On perpendicular arrays witht ≥ 3,Ars Combin., to appear.
C. C. Lindner and D. R. Stinson, Steiner pentagon systems,Discrete Math. 52 (1984), 67–74.
J. L. Massey, Cryptography—a selective survey, inDigital Communications, 1986, pp. 3–21.
J. L. Massey, An introduction to contemporary cryptology,Proc. IEEE 76 (1988), 533–549.
R. C. Mullin, P. J. Schellenberg, G. H. J. van Rees, and S. A. Vanstone, On the construction of perpendicular arrays,Utilitas Math. 18 (1980), 141–160.
R. L. Rivest, A. Shamir, and L. M. Adelman, A method for obtaining digital signatures and public-key cryptosystems,Comm. ACM 21 (1978), 120–126.
P. Schobi, Perfect authentication systems for data sources with arbitrary statistics, presented at Eurocrypt '86.
C. E. Shannon, Communication theory of secrecy systems,Bell System Tech. J. 28 (1949), 656–715.
G. J. Simmons, A game theory model of digital message authentication,Congr. Numer. 34 (1982), 413–424.
G. J. Simmons, Verification of treaty compliance—revisited, inProc. IEEE 1983Symposium on Security and Privacy, Oakland, 1984, pp. 61–66.
G. J. Simmons, Message authentication: a game on hypergraphs,Congr. Numer. 45 (1984), 161–192.
G. J. Simmons, Authentication theory/coding theory, inAdvances in Cryptology: Proceedings of CRYPTO 84, Lecture Notes in Computer Science, vol. 196, Springer-Verlag, Berlin, 1985, pp. 411–432.
G. J. Simmons, The practice of authentication, inAdvances in Cryptology: EUROCRYPT 85, Lecture Notes in Computer Science, vol. 219, Springer-Verlag, Berlin, 1986, pp. 261–272.
G. J. Simmons, Authentication codes that permit arbitration,Congr. Numer. 59 (1987), 275–290.
G. J. Simmons, A natural taxonomy for digital information authentication schemes, inAdvances in Cryptology: CRYPTO 87Proceedings, Lecture Notes in Computer Science, vol. 293, Springer-Verlag, Berlin, 1988, pp. 269–288.
G. J. Simmons, A survey of information authentication,Proc. IEEE 76 (1988), 603–620.
D. R. Stinson, Some constructions and bounds for authentication codes,J. Cryptology 1 (1988), 37–51.
D. R. Stinson, A construction for authentication/secrecy codes from certain combinatorial designs.J. Cryptology 1 (1988), 119–127.
D. R. Stinson and L. Teirlinck, A construction for authentication/secrecy codes from 3-homogeneous permutation groups,European J. Combin., to appear.
G. S. Vernam, Cipher printing telegraph systems for secret wire and radio telegraph communications,J. Amer. Inst. Elec. Eng. 45 (1926), 109–115.
E. Witt, Uber Steinersche Systeme,Abh. Math. Sem. Univ. Hamburg 12 (1938), 265–275.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Stinson, D.R. The combinatorics of authentication and secrecy codes. J. Cryptology 2, 23–49 (1990). https://doi.org/10.1007/BF02252868
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02252868