Abstract
A key distribution pattern is a combinatorial structure which provides a secure method of distributing secret keys among a number of participants in a cryptographic network. Inversive and Laguerre planes have been used to construct key distribution patterns with storage requirements lower than the trivial distribution system. In this paper we review these and introduce key distribution patterns arising from Minkowski planes, the third of the so-called circle geometries. In addition, we give a comparison of the storage requirements of the key distribution patterns associated with each of the circle geometries.
The author acknowledges the support of the Australian Research Council.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
W. Benz: Über die Grundlagen der Geometrie der Kreise in der pseudoeuklidischen (Minkowskischen) Geometrie. J. Reine Angew. Math. 232 (1968) 41–76
T. Beth, D. Jungnickel, Lenz: Design Theory. Cambridge University Press, Cambridge, 1986
A. Beutelspacher: Einfuhrung in die endliche Geometrie II: Projective Raume. Bibliographisches Institut. Mannheim 1983
R. Blom: An optimal class of symmetric key generation systems. Advances in Cryptology: Proceedings of Eurocrypt '84, Springer-Verlag, Berlin. Lecture Notes in Computer Science 209 (1985) 335–338
P. Dembowski: Finite Geometries. Springer-Verlag, Berlin Heidelberg, 1968
C.J.A. Jansen: On the key storage requirements for secure terminals. Comput. Security 5 (1986) 145–149
T. Matsumoto and H. Imai: On the KEY PREDISTRIBUTION SYSTEM: A practical solution to the Key Distribution Problem. Advances in Cryptology: Proceedings of Crypto '87, Springer-Verlag, Berlin. Lecture Notes in Computer Science 293 (1987) 185–193
C.J. Mitchell: Combinatorial techniques for key storage reduction in secure networks. Technical memo, Hewlett-Packard Laboratories, Bristol, 1988
C.J. Mitchell and F.C. Piper: Key storage in secure networks. Discrete Applied Mathematics 21 (1988) 215–228
C.M. O'Keefe: Applications of finite geometries to information security. submitted
C.M. O'Keefe: Geometrical constructions for key distribution patterns. in preparation
K.A.S. Quinn: Combinatorial Structures with Applications to Information Theory PhD Thesis. RHBNC, University of London, 1991
G.J. Simmons: Contemporary Cryptology. ed., IEEE Press, New York, 1992
J.A. Thas: Circle geometries and generalized quadrangles. Finite Geometries, Dekker, New York, 1985, 327–352
M. Yung, C. Blundo, A. De Santis, U. Vaccaro, X. Herzberg, X. Kutten: Perfectly secure key distribution for dynamic conferences. Advances in Cryptology: Proceedings of Crypto '92, to appear
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
O'Keefe, C.M. (1993). A comparison of key distribution patterns constructed from circle geometries. In: Seberry, J., Zheng, Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57220-1_89
Download citation
DOI: https://doi.org/10.1007/3-540-57220-1_89
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57220-6
Online ISBN: 978-3-540-47976-5
eBook Packages: Springer Book Archive