Abstract
In this paper we prove two general characterization theorems for A-codes, that provide r-fold security, in terms of well-known combinatorial structures (t-designs and orthogonal arrays). We use Delsarte's linear programming method to find new bounds on the number of encoding rules for Cartesian A-codes with 1-fold and 2-folds security and show that in the latter case the bound is achieved by A-codes obtained from the dual of two well-studied error correcting codes: an MDS code and the extended Hamming code.
Support for this project was partly provided by Australian Research Council grant A49030136.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D.R. Stinson, The combinatorics of authentication and secrecy codes, Journal Cryptology 2, (1990), 23–49.
D.R. Stinson, Combinatorial characterization of authentication codes, Lecture Notes in Comput. Sci. 576, Proceedings of Crypto 91, Springer-Verlag, 1992, 62–72.
P. Schobi, Perfect authentication systems for data sources with arbitrary statistics, presented at Eurocrypt '86.
J.H. Dinitz, D. Stinson, Contemporary Design Theory. A Collection of Surveys, A Wiley Interscience Publications, JOHN WILEY & SONS, INC, 1992.
J. MacWilliams, N. Sloane, The theory of error correcting codes, Noth Holland Publishing Company, 1978.
S. Roman, Coding and Information Theory, Springer Verlag, 1992.
L. Tombak, R. Safavi-Naini, Authentication codes with perfect protection Advances in Cryptology-AusCrypt'92, LNCS 718, Springer-Verlag, 1993, pp 15–26.
Ph. Delsarte, An algebraic approach to the association schemes of coding theory, Phillips Res. Rep. Suppl. 10,1973.
R.S. Rees, D.R. Stinson, Combinatorial Characterization of Authentication Codes II, personal communication.
C. Mitchell, M. Walker, P. Wild, The combinatorics of perfect authentication schemes, SIAM Journal of Discrete Mathematics, Vol 7, No 1, pp 102–107, 1994.
M. De Soete, K. Vedder, M. Walker, Cartesian Authentication Schemes, Advances in Cryptology, proc. of Eurocrypt '89, Lecture Notes in Computer Science, vol 434, Springer Verlag 1990, pp 476–490.
C.R. Rao, Factorial experiments derivable from combinatorial arrangements of arrays, J. Roy. Statist. Soc. 9, 128–139, 1947
A.Davydov, L.Tombak, Number of minimal-weight words in block codes, Problems of Information Transmission, Vol 24, No1, pp 11–24, 1988.
H.C.A van Tilborg, Uniformly packed Codes, Thesis, Eindhoven University of Technology (1976).
J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson, Bounds for resilient functions and orthogonal arrays, Advances in Cryptology — Crypto '94, Proceedings (Lecture Notes in Computer Science 839), pp 247–256.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Safavi-Naini, R., Tombak, L. (1995). Combinatorial structure of A-codes with r-fold security. In: Pieprzyk, J., Safavi-Naini, R. (eds) Advances in Cryptology — ASIACRYPT'94. ASIACRYPT 1994. Lecture Notes in Computer Science, vol 917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000436
Download citation
DOI: https://doi.org/10.1007/BFb0000436
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59339-3
Online ISBN: 978-3-540-49236-8
eBook Packages: Springer Book Archive