A Construction of Authentication Codes with Secrecy
Xiaojian Tian, Cunsheng Ding · Birkhäuser Basel eBooks · 2004
In this paper, we construct a class of authentication/secrecy codes which provide ordered perfect L-fold secrecy. The class of authentication codes meets the information-theoretic bounds of deception probabilities. Some of them also meet a lower bound on the number of encoding rules. The authentication codes are thus optimal with respect to the two types of bounds.