Foundations and Trends® in Communications and Information Theory > Vol 5 > Issue 6

Combinatorial Designs for Authentication and Secrecy Codes

Michael Huber, Wilhelm Schickard Institute for Computer Science, University of Tuebingen, Germany, michael.huber@uni-tuebingen.de
 
Suggested Citation
Michael Huber (2010), "Combinatorial Designs for Authentication and Secrecy Codes", Foundations and TrendsĀ® in Communications and Information Theory: Vol. 5: No. 6, pp 581-675. http://dx.doi.org/10.1561/0100000044

Published: 30 May 2010
© 2010 M. Huber
 
Subjects
Coding theory and practice,  Cryptology and data security,  Security
 

Free Preview:

Article Help

Share

Download article
In this article:
1. Introduction
2. Combinatorial Design Theory
3. Applications to Authentication and Secrecy Codes
Appendix
Acknowledgments
References

Abstract

Combinatorial design theory is a very active area of mathematical research, with many applications in communications and information theory, computer science, statistics, engineering, and life sciences. As one of the fundamental discrete structures, combinatorial designs are used in fields as diverse as error-correcting codes, statistical design of experiments, cryptography and information security, mobile and wireless communications, group testing algorithms in DNA screening, software and hardware testing, and interconnection networks. This monograph provides a tutorial on combinatorial designs, which gives an overview of the theory. Furthermore, the application of combinatorial designs to authentication and secrecy codes is described in depth. This close relationship of designs with cryptography and information security was first revealed in Shannon's seminal paper on secrecy systems. We bring together in one source foundational and current contributions concerning design-theoretic constructions and characterizations of authentication and secrecy codes.

DOI:10.1561/0100000044
ISBN: 978-1-60198-358-9
104 pp. $75.00
Buy book
 
ISBN: 978-1-60198-359-6
104 pp. $100.00
Buy E-book
Table of contents:
1. Introduction
2. Combinatorial Design Theory
3. Applications to Authentication and Secrecy Codes
Appendix
Acknowledgments
References

Combinatorial Designs for Authentication and Secrecy Codes

Authenticity and secrecy are two crucial concepts in cryptography and information security. Although independent in their nature, certain applications require that both aspects hold simultaneously. In the case if unconditional, or information-theoretic, security authentication and secrecy codes can be used to maximise the likelihood of detecting deception. The construction of such codes is of great importance and has been considered by many researchers over the last few decades.

Combinatorial Designs for Authentication and Secrecy Codes describes in depth classical and current interconnections between combinatorial designs and authentication and secrecy codes. Moreover, it provides a tutorial overview on the theory of combinatorial designs. These fundamental discrete structures find applications in fields as diverse as error-correcting codes, statistical design of experiments, cryptography and information security, mobile and wireless communications, group testing algorithms in DNA screening, software and hardware testing, and interconnection networks. In particular, the last few years have witnessed an increasing body of work in the communications and information theory literature that makes substantial use of results in combinatorial design theory.

Combinatorial Designs for Authentication and Secrecy Codes is a succinct in-depth review and tutorial of a subject that promises to lead to major advances in computer and communication security.

 
CIT-044