Combinatorial Constructions for Optimal Splitting Authentication Codes
Combinatorial Constructions for Optimal Splitting Authentication Codes
复制标题
DOI：
10.1137/s0895480103435469
复制
发表时间：
2005-04
期刊：
影响因子：
--
通讯作者：
G. Ge;Y. Miao;Lihua Wang
中科院分区：
文献类型：
--
作者：
G. Ge;Y. Miao;Lihua Wang
在具有仲裁的身份验证代码的上下文中，分裂身份验证代码的概念非常重要。 Ogata等。 [离散数学，279（2004），pp。383--405]根据拆分平衡不完整的块设计（BIBD）来表征最佳的分裂身份验证代码。 a $（v，u \ times c，1）$ - 拆分bibd是一对$（{\ cal v}，{\ cal b}）$，其中$ {\ cal v} $是点的v-stet $ {\ cal b} $是$ u \ times c $阵列的集合，称为块，带有$ {\ cal v} $的条目，以至于$ {\ cal的任何点v} $最多可以在任何块中发生一次，对于任何$ {\ cal v} $的两个不同的点x和y，恰好有一个$ {\ cal b} $的一个块，其中x和y在不同行。在本文中，我们描述了各种组合构造，用于分裂bibds（或等效地，最佳的分裂身份验证代码）。我们表明，存在$（v，u \ times c，1）$的必要条件 - 拆分bibd（或等效地，使用...
The notion of a splitting authentication code is very important in the context of an authentication code with arbitration. Ogata et al. [Discrete Math., 279 (2004), pp. 383--405] characterized an optimal splitting authentication code in terms of a splitting balanced incomplete block design (BIBD). A $(v,u \times c,1)$-splitting BIBD is a pair $({\cal V}, {\cal B})$, where ${\cal V}$ is a v-set of points and ${\cal B}$ is a collection of $u \times c$ arrays, called blocks, with entries from ${\cal V}$, such that any point of ${\cal V}$ can occur at most once in any block, and forany two distinct points x and y of ${\cal V}$, there is exactly one block of ${\cal B}$ in which x and y occur in different rows. In this paper, we describe various combinatorial constructions for splitting BIBDs (or, equivalently, optimal splitting authentication codes). We show that the necessary conditions for the existence of a $(v,u \times c,1)$-splitting BIBD (or, equivalently, an optimal c-splitting authentication code with ...