Combinatorial Bounds and Characterizations of Splitting Authentication Codes
Cryptography and Security
2018-07-03 v1 Information Theory
math.IT
Abstract
We present several generalizations of results for splitting authentication codes by studying the aspect of multi-fold security. As the two primary results, we prove a combinatorial lower bound on the number of encoding rules and a combinatorial characterization of optimal splitting authentication codes that are multi-fold secure against spoofing attacks. The characterization is based on a new type of combinatorial designs, which we introduce and for which basic necessary conditions are given regarding their existence.
Cite
@article{arxiv.1001.3780,
title = {Combinatorial Bounds and Characterizations of Splitting Authentication Codes},
author = {Michael Huber},
journal= {arXiv preprint arXiv:1001.3780},
year = {2018}
}
Comments
13 pages; to appear in "Cryptography and Communications"