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 of 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.