Cartesian Authentication Schemes
This paper gives a characterisation of perfect Cartersian authentication schemes. It is shown that their existence is equivalent to the existence of nets. Furthermore the paper presents constructions of new authentication schemes derived from generalised n-gons which take on the lowest combinatorial bound for the impersonation attack. They include, as special cases, those based on projective planes and generalised quadrangles which are described in  and  respectively. It investigates the properties of the encoding rules and contains a brief discussion of questions in connection with key management.
- R. C. Bose, Graphs and designs, in: Finite geometric structures and their applications, ed. A. Barlotti, Ed. Cremonese Roma (1973), 1–104.Google Scholar
- P. Dembowski, Finite Geometries, Springer Verlag, 1968.Google Scholar
- M. De Soete, Some Constructions for Authentication / Secrecy Codes, Advances in Cryptology-Proceedings of Eurocrypt’ 88, Lect. Notes Comp. Science 330, Springer 1988, 57–75.Google Scholar
- D. Jungnickel, Graphen, Netzwerke und Algorithmen, Wissenschaftsverlag Bib. Inst. Zürich, 1987.Google Scholar
- G. J. Simmons, Authentication Theory / Coding Theory, Advances in Cryptology-Proceedings of Crypto’84, Lect. Notes Comp. Science 196, Springer 1985, 411–432.Google Scholar