Abstract
We deal with authentication / secrecy codes having unconditional security. Besides some new results for a “spoofing attack of order L”, we give several constructions using finite incidence structures (designs, generalized quadrangles).
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
T. Beth, D. Jungnickel, H. Lenz, Design Theory, Wissenschaftsverlag Bibliografisches Institut Mannheim, 1985.
A. Beutelspacher, Perfect and essentially perfect authentication schemes, Extended abstract, Eurocrypt 1987, Amsterdam.
P. J. Cameron, J. H. Van Lint, Graph Theory, Coding Theory and Block Designs, Lond. Math. Soc. Lect. Notes 19, Camb. Univ. Press, 1975.
E. F. Brickell, A few results in message authentication, Proc. of the 15th Southeastern Conf. on Combinatorics, Graph theory and Computing, Boca Raton LA (1984), 141–154.
M. De Soete, J. A. Thas, A coordinatization of the generalized quadrangles of order (s, s + 2), to appear in J. C. T. (A).
E. N. Gilbert, F. J. MacWilliams, N. J. A. Sloane, Codes which detect deception, Bell Sys. Techn. J., Vol. 53–3 (1974), 405–424.
Hanani H., A Class of Three-Designs. J.C.T.(A) 26 (1979), 1–19.
D. R. Hughes, F. C. Piper, Design theory, Cambridge University Press, 1985.
J. L. Massey, Cryptography-A Selective Survey, Proc. of 1985 Int. Tirrenia Workshop on Digital Communications, Tirrenia, Italy, 1985, Digital Communications, ed. E. Biglieri and G. Prati, Elsevier Science Publ., 1986, 3–25.
S. E. Payne, J. A. Thas, Finite generalized quadrangles, Research Notes in Math. #110, Pitman Publ. Inc. 1984.
P. Schöbi, Perfect authentication systems for data sources with arbitrary statistics, Eurocrypt 1986, Preprint.
C. E. Shannon, Communication Theory of Secrecy Systems. Bell Technical Journal, Vol.28 (1949), 656–715.
G. J. Simmons, Message Authentication: A Game on Hypergraphs, Proc. of the 15th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Baton Rouge LA Mar 5–8 1984, Cong. Num. 45 (1984), 161–192.
G. J. Simmons, Authentication theory / Coding theory, Proc. of Crypto’84, Santa Barbara, CA, Aug 19–22, 1984, Advances in Cryptology, ed. R. Blakley, Lect. Notes Comp. Science 196, Springer 1985, 411–432.
G. J. Simmons, A natural taxonomy for digital information authentication schemes, Proc. of Crypto’ 87, Santa Barbara, CA, Aug 16–20, 1987, to appear in Advances in Cryptology, ed. C. Pomerance, Springer-Verlag, Berlin.
D. R. Stinson, Some constructions and bounds for authentication codes, Crypto’86, Santa Barbara, CA, Aug 12–15, 1986, Advances in Cryptology, ed. A. M. Odlyzko, Springer-Verlag, Berlin, 1987, 418–425.
D. R. Stinson, A construction for authentication / secrecy codes from certain combinatorial designs, Crypto’ 87, Santa Barbara, CA, Aug 16–20, 1987, to appear in Journal of Cryptology.
D. R. Stinson, Some constructions and bounds for authentication codes, J. Cryptology, Vol.1 nr1 (1988), 37–51.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Soete, M. (1988). Some Constructions for Authentication - Secrecy Codes. In: Barstow, D., et al. Advances in Cryptology — EUROCRYPT ’88. EUROCRYPT 1988. Lecture Notes in Computer Science, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45961-8_6
Download citation
DOI: https://doi.org/10.1007/3-540-45961-8_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50251-7
Online ISBN: 978-3-540-45961-3
eBook Packages: Springer Book Archive