Abstract
In this paper, we present a simple and generic construction of systematic authentication codes which are optimal with respect to several bounds. The construction is based on error correcting codes. The authentication codes provide the best level of security with respect to spoofing attacks of various orders, including the impersonation and substitution attacks. The encoding of source states and the authentication verification are very simple and are perhaps the most efficient among all authentication systems.
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
J. Bierbrauer. Universal hashing and geometric codes. Designs, Codes and Cryptography, 11:207–221, 1997.
J. Bierbrauer, T. Johansson, G. Kabatianskii, and B. Smeets. On families of hash functions via geometric codes and concatenation. In Advances in Cryptology-Crypto’ 93, pages 331–342, 1994. Springer LNCS 773.
L.R.A. Casse, K.M. Martin, and P.R. Wild. Bounds and characterizations of authentication/ secrecy schemes. Designs, Codes and Cryptography, 13:107–129, 1998.
C.J. Colbourn and J.H. Dinitz. CRC Handbook of Combinatorial Designs. CRC Press, 1996.
M.A. De Boer. Almost MDS codes. Designs, Codes and Cryptography, 9:143–155, 1996.
E.N. Gilbert, F.J. MacWilliams, and N.J.A. Sloane. Codes which detect deception, Bell System Tech. Journal, 53:405–424, 1974.
J.W.P. Hirschfeld, and L. Storme. The packing problem in statistics, coding theory and finite projective spaces. J. Statistics Planning and Inference, 72:355–380, 1998.
G.A. Kabatianskii, B. Smeets, and T. Johansson. On the cardinality of systematic authentication codes via error-correcting codes. IEEE Trans. Inform. Theory, 42:566–578, 1996.
K. Kurosawa, K. Okada, H. Saido, and D.R. Stinson. New combinatorial bounds for authentication codes and key predistribution schemes. Designs, Codes and Cryptography, 15:87–100, 1998.
J.L. Massey. Cryptography: A selective survey. In Digital Communications, pages 3–21. North-Holland, 1986.
F.J. MacWilliams and N.J.A. Sloane. The theory of Error Correcting Codes. North-Holland, Amsterdam, 1977.
V.S. Pless, An introduction to algebraic codes. In Handbook of Coding Theory I, pages 1–139. North-Holland/Elsevier, 1998.
R.S. Rees and D.R. Stinson. Combinatorial characterizations of authentication codes. Designs, Codes and Cryptography, 7:239–259, 1996.
U. Rosenbaum. A lower bound on authentication after having observed a sequence of messages. J. Cryptology, 6:135–156, 1993.
R. Safavi-Naini, and J. Seberry. Error correcting codes for authentication and sublimal channels. IEEE Trans. Information Theory, 37(1):13–17, 1991.
R. Safavi-Naini, H. Wang, and C. Xing. Linear authentication codes: bounds and constructions. In Progress in Cryptology-INDOCRYPT 2001, pages 127–135. Springer LNCS 2247, 2001.
A. Sgarro. Information-theoretic bounds for authentication frauds. J. Computer Security, 2:53–63, 1993.
C.E. Shannon. Communication theory of secrecy systems. Bell System Tech. Journal, 28:656–715, 1949.
G.J. Simmons. Authentication theory/coding theory. In Advances in Cryptology: Proceedings of Crypto’ 84, pages 411–432. Springer LNCS 196, Berlin, 1985.
D.R. Stinson. The combinatorics of authentication and secrecy codes. J. Cryptology, 2:23–49, 1990.
D.R. Stinson. Combinatorial characterizations of authentication codes. Designs, Codes, and Cryptography, 2:175–187, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Ding, C., Tian, X., Wang, X. (2004). Simple and Efficient Systematic a-Codes from Error Correcting Codes. In: Chen, K. (eds) Progress on Cryptography. The International Series in Engineering and Computer Science, vol 769. Springer, Boston, MA. https://doi.org/10.1007/1-4020-7987-7_5
Download citation
DOI: https://doi.org/10.1007/1-4020-7987-7_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7986-3
Online ISBN: 978-1-4020-7987-0
eBook Packages: Springer Book Archive