Constructing Optimal Authentication Codes with Perfect Multi-fold Secrecy
Cryptography and Security
2009-12-04 v1 Information Theory
math.IT
Abstract
We establish a construction of optimal authentication codes achieving perfect multi-fold secrecy by means of combinatorial designs. This continues the author's work (ISIT 2009) and answers an open question posed therein. As an application, we present the first infinite class of optimal codes that provide two-fold security against spoofing attacks and at the same time perfect two- fold secrecy.
Cite
@article{arxiv.0912.0597,
title = {Constructing Optimal Authentication Codes with Perfect Multi-fold Secrecy},
author = {Michael Huber},
journal= {arXiv preprint arXiv:0912.0597},
year = {2009}
}
Comments
4 pages (double-column); to appear in Proc. 2010 International Zurich Seminar on Communications (IZS 2010, Zurich)