Abstract
In this paper, we construct a class of authentication/secrecy codes which provide ordered perfect L-fold secrecy. The class of authentication codes meets the information-theoretic bounds of deception probabilities. Some of them also meet a lower bound on the number of encoding rules. The authentication codes are thus optimal with respect to the two types of bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.C. Bose, Mathematical theory of the symmetrical factorial design Sankhya 8 (1947), 107–166.
L.R.A. Casse, K.M. Martin and P.R. Wild, Bounds and characterizations of authentication/secrecy schemes Designs Codes and Cryptography 13 (1998), 107–129.
P. Godlewski and C. Mitchell, Key-minimal cryptosystems for unconditional secrecy J. Cryptology 3 (1990), 1–25.
E.N. Gilbert, F.J. MacWilliams and N.J.A. Sloane, Codes which detect deception Bell System Tech. Journal 53 (1974), 405–424.
J.W.P. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces J. Statistics Planning and Inference 72 (1998), 355–380.
J.L. Massey, Cryptography — A selective survey, in: Digital Communications North-Holland (1986), 3–21.
D. Pei, Information-theoretic bounds for authentication codes and block designs J. of Cryptology 8 (1995), 177–188.
D. Pei, A problem of combinatorial designs related to authentication codes J. of Combinatorial Designs 6(6) (1998), 417–429.
R.S. Rees and D.R. Stinson, Combinatorial characterizations of authentication codes Designs Codes and Cryptography 7 (1996), 239–259.
U. Rosenbaum, A lower bound on authentication after having observed a sequence of messages J. Cryptology 6 (1993), 135–156.
B. Segre, Ovals in a finite projective plane Canad. J. Math. 7 (1955), 414–416.
A. Sgarro, Information-theoretic bounds for authentication frauds J. Computer Security 2 (1993), 53–63.
M.D. Soete, Some constructions for authentication-secrecy codes, in: Advances in Cryptology: Proceedings of Eurocrypt’ 88 Lecture Notes in Computer Science 330, Springer-Verlag, 1988, 57–75.
C.E. Shannon, Communication theory of secrecy systems Bell System Tech. Journal 28 (1949), 656–715.
G.J. Simmons, Authentication theory/coding theory, in: Advances in Cryptology: Proceedings of Crypto’ 84 Lecture Notes in Computer Science 196, 411–432. Berlin: Springer-Verlag, 1985.
D.R. Stinson and L. Teirlinck, A construction for authentication/secrecy codes from 3-homogeneous permutation groups J. Combinatorics 11 (1990), 73–79.
D.R. Stinson, A construction for authentication/secrecy codes from certain combinatorial designs J. Cryptology 1 (1988), 37–51.
D.R. Stinson, The combinatorics of authentication and secrecy codes J. Cryptology 2 (1990), 23–49
D.R. Stinson, Combinatorial characterizations of authentication codes Designs Codes and Cryptography 2 (1992), 175–187.
T.V. Trung, On the construction of authentication and secrecy codes Designs Codes and Cryptography 5 (1995), 269–280.
Z. Wan Geometry of Classical Groups over Finite Fields Studentlitteratur, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Basel AG
About this paper
Cite this paper
Tian, X., Ding, C. (2004). A Construction of Authentication Codes with Secrecy. In: Feng, K., Niederreiter, H., Xing, C. (eds) Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic, vol 23. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7865-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-0348-7865-4_22
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9602-3
Online ISBN: 978-3-0348-7865-4
eBook Packages: Springer Book Archive