Combinatorial bounds and characterizations of splitting authentication codes

被引:0
|
作者
Michael Huber
机构
[1] University of Tübingen,Wilhelm
来源
关键词
Information authenticity; Unconditional security; Authentication code; Splitting; Non-deterministic encoding; Splitting design; 94A60; 94C30;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:173 / 185
页数:12
相关论文
共 50 条