Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order
Cryptography and Security
2010-10-05 v1 Discrete Mathematics
Information Theory
Combinatorics
math.IT
Abstract
We consider the problem of constructing optimal authentication codes with splitting. New infinite families of such codes are obtained. In particular, we establish the first known infinite family of optimal authentication codes with splitting that are secure against spoofing attacks of order two.
Cite
@article{arxiv.1010.0280,
title = {Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order},
author = {Yeow Meng Chee and Xiande Zhang and Hui Zhang},
journal= {arXiv preprint arXiv:1010.0280},
year = {2010}
}
Comments
to appear in Advances in Mathematics of Communications (accepted September 2010)