基于酉几何的具有仲裁的认证码的构造

具有仲裁的认证码即要防止敌手的欺骗,又要防止收方和发方的互相欺骗．本文给出一种由酉几何构造具有仲裁的认证码的方法,并计算了有关参娄,分析了各种攻击成功的概率。     

利用奇异酉几何构造新的带仲裁的认证码

带仲裁的认证码既要防止敌人的欺骗,又要防止收方和发方的相互欺骗.文章利用有限域上奇异酉几何构造了一个新的带仲裁的认证码,计算了这个码的各种参数.当收方和发方的编码规则按等概率分布选取时,计算出了各种攻击成功的概率.     

各阶欺骗概率相等的最优认证码

本文研究各阶欺骗概率相等的、一般阶的最优认证码的构造。利用有限域上高次抛物线、M-序列和线性校验办法分别构造了一类保密最优认证码和两类Cartesian最优认证码。     

带有仲裁认证码的组合论下界

本文给出了带有仲裁认证码的组合论下界,并利用带有约束的t-设计,给出了敌方的r阶欺骗攻击成功的概率达到下界的带有仲裁认证码的组合结构。     

基于有限域上的辛几何构造带仲裁的多接收认证码

在通信中,发方发送信息给一群收方.但是,发方或者部分收方有时会联合欺骗群组中的某个成员.多接收认证码能够有效地阻止这种欺骗攻击.本文的目的是研究多接收认证码的构造问题.运用有限域上的辛几何这一工具,构造了一类带仲裁的多接收认证码,并证明其合理性.然后,充分运用辛空间的子空间结构及其计数原理,计算了相关参数以及被各类攻击成功的最大概率.最后,对该多接收认证码所受到的来自发方的假冒攻击进行仿真.     

基于有限域上的辛几何构造带仲裁的多接收认证码北大核心CSCD

在通信中,发方发送信息给一群收方．但是,发方或者部分收方有时会联合欺骗群组中的某个成员．多接收认证码能够有效地阻止这种欺骗攻击．本文的目的是研究多接收认证码的构造问题．运用有限域上的辛几何这一工具,构造了一类带仲裁的多接收认证码,并证明其合理性．然后,充分运用辛空间的子空间结构及其计数原理,计算了相关参数以及被各类攻击成功的最大概率．最后,对该多接收认证码所受到的来自发方的假冒攻击进行仿真．     

多个接收者认证码的信息论下界及其组合特征

对一般的（带保密的）多个接收者认证码进行了讨论，给出了这类认证码的ｒ阶欺骗攻击成功概率的信息论下界，并利用部分平衡ｔ－设计和狭义区组设计刻划了达到信息论下界的多个接收者认证码的组合特征。     

构造任意阶的最优带仲裁认证码

本文首次给出了一类具有任意给定阶的最优带仲裁认证码的构造方法.     

最优带仲裁认证码

本文研究带仲裁认证码（亦称A^2-码）。一个A^2-码，当它的欺骗攻击成功概率达到信息论下界且密钥长度也达到最小时称为是最优的。本文给出最优A^2-码的组合结构的特征，从而将构造最优A^2-码的问题归结为构造相应的一类组合设计的问题。     

利用奇、偶特征的正交几何构作的最优Cartesian认证码

利用奇、偶特征有限域上的正交几何构作出一类C artesian认证码,并且计算了它们的参数.并在假定按照等概率分布来选择编码规则下,求出了认证码的成功的模仿攻击概率和成功的替换攻击概率.作为一个推论,还得到了一些最优的C artesian认证码.     

A construction for t-fold perfect authentication codes with arbitration

Authentication codes with arbitration protect against deceptions from the transmitter and the receiver as well as that from the opponent. An authentication code with arbitration is t-fold perfect if the numbers of decoding rules and encoding rules meet the information-theoretic lower bounds. Pei (Message authentication codes (in Chinese). USCT, Hefei, 2009) pointed out that there has not yet been able to construct t-fold perfect authentication codes with arbitration for \(t > 2\) . In this paper, we define a new design, perfect strong strict restricted partially balanced t-design, and prove that the existence of perfect strong strict restricted partially balanced t-designs implies the existence of t-fold perfect authentication codes with arbitration. Further, we obtain some new infinite classes of t-fold perfect authentication codes with arbitration.     

利用酉几何构作带仲裁的认证码

A family of authentication codes with arbitration is constructed from unitary geome-try,the parameters and the probabilities of deceptions of the codes are also computed. In a spe-cial case a perfect authentication code with arbitration is ohtalned.     

ON THE CONSTRUCTION OF AUTHENTICATION CODES THAT PERMIT ARBITRATION OVER PROJECTIVE SPACES

A family of authentication codes with arbitration are constructed over projective spaces, the parameters and the probabilities of deceptions of the codes are also computed. In a special case, a perfect authentication code with arbitration is obtained.     

利用有限域上酉几何构作带仲裁的认证码

利用有限域上酉几何构作一类新的带仲裁的认证码,并且计算了所构作认证码的参数以及各种攻击成功的概率.     

GOB designs for authentication codes with arbitration

Combinatorial characterization of optimal authentication codes with arbitration was previously given by several groups of researchers in terms of affine α-resolvable + BIBDs and α-resolvable designs with some special properties, respectively. In this paper, we revisit this known characterization and restate it using a new idea of GOB designs. This newly introduced combinatorial structure simplifies the characterization, and enables us to extend Johansson’s well-known family of optimal authentication codes with arbitration to any finite projective spaces with dimension greater than or equal to 3.     

On Construction of Optimal A2-Codes

§ 1.Ｉｎｔｒｏｄｕｃｔｉｏｎ　Ｔｈｅａｕｔｈｅｎｔｉｃａｔｉｏｎｃｏｄｅｓｗｉｔｈａｒｂｉｔｒａｔｉｏｎ (Ａ2 ｃｏｄｅｓ)ａｒｅｉｎｔｒｏｄｕｃｅｄｂｙＳｉｍｍｏｎｓ[1]ａｎｄｓｔｕｄｉｅｄｉｎｍａｎｙｐａｐｅｒｓ (ｆｏｒｅｘａｍｐｌｅ ,[1— 8] ) .Ｏｎｅｏｆｔｈｅｍｏｓｔｉｍｐｏｒｔａｎｔｐｒｏｂｌｅｍｓｉｎｔｈｅｓｔｕｄｙｏｆａｕｔｈｅｎｔｉｃａｔｉｏｎｃｏｄｅｓｉｓｔｏｆｉｎｄｌｏｗｅｒｂｏｕｎｄｓｏｎｃｈｅａｔｉｎｇｐｒｏｂａｂｉｌｉｔｉｅｓａｎｄｏｎｔｈｅｎｕｍｂｅｒｓｏｆｅｎｃｏｄｉ…     

利用有限域上奇异伪辛几何构作具有仲裁的认证码

利用有限域上奇异伪辛几何构作了一个新的具有仲裁的认证码,计算了这个码的参数,当发方编码规则和收方解码规则按等概率分布选取时,计算出各种攻击成功的概率.     

利用有限域上奇异伪辛几何构作具有仲裁的认证码

A construction of authentication codes with arbitration from singular pseudo-symplectic geometry over finite fields is given and the parameters of the code are computed. Under the assumption that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of success for different types of deceptions are also computed.     

Combinatorial Bounds on Authentication Codes with Arbitration

Unconditionallysecure authentication codes with arbitration ( A²-codes)protect against deceptions from the transmitter and the receiveras well as that from the opponent. In this paper, we presentcombinatorial lower bounds on the cheating probabilities andthe sizes of keys of A²-codes. These bounds areall tight. Our main technique is a reduction of an A²-codeto a splitting A-code.