Abstract
This paper is concerned with cryptosystems offering unconditional secrecy. For those perfect secrecy systems which involve using key just once, the theory is well established since Shannon’s works; however, this is not the case for those systems which involve using a key several times. This paper intends to take a rigorous approach to the definition of such systems. We use the basic model for a security code developped by Simmons, initially for unconditional authentication. We consider the definition of perfect L-fold secrecy given by Stinson and used by De Soete and others. We consider other definitions: Ordered Perfect L-fold secrety and Massey’s Perfect L-fold secrecy, and attempt to classify them. Lower bounds are given for the number of keys in such perfect systems, and characterisation of systems meeting these lower bounds are obtained. The last part of the paper is concerned with discussing examples of key minimal systems providing unconditional secrecy.
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
E.F. Brickell, “A few results in message authentication”, Congressus Numerantium 43 (1984) 141–154.
M. De Soete, “Some constructions for authentication-secrecy codes”, paper given at Eurocrypt 88.
M. De Soete, “Bounds and constructions for authentication-secrecy codes”, paper given at Crypto 88.
E.N. Gilbert, F.J. MacWilliams and N.J.A. Sloane, “Codes which detect deception”, Bell System Technical Journal 53 (1974) 405–424.
J.L. Massey, “Cryptography-a selective survey”, in: Digital Communications, editors: C. Biglieri and C. Prati, Elsevier (North-Holland), 1986, pp. 3–21.
R.C. Mullin, P.J. Schellenberg, G.H.J. van Rees and S.A. Vanstone, “On the construction of perpendicular arrays”, Utilitas Mathematica 18 (1980) 141–160.
C.R. Rao, “Combinatorial arrangements analogous to orthogonal arrays”, Sankhya Series A 23 (1961) 283–286.
C.E. Shannon, “Communication theory of secrecy systems”, Bell System Technical Journal 28 (1949) 656–715.
G. Simmons, “Authentication theory/coding theory”, in: Advances in Cryptology: Proceedings of Crypto 84, Springer-Verlag (Berlin), 1985, pp. 411–431.
D.R. Stinson, “A construction for authentication/secrecy codes from certain combinatorial designs”, in: Advances in Cryptology: Proceedings of Crypto 87, Springer-Verlag (Berlin), 1988, pp. 355–366.
D.R. Stinson, “Some constructions and bounds for authentication codes”, Journal of Cryptology 1 (1988) 37–51.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Godlewski, P., Mitchell, C. (1990). Key Minimal Authentication Systems for Unconditional Secrecy. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_48
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive