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

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.     

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

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

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.     

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

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

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.     

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

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

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

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

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

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.     

On Construction of Optimal A2-Codes

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

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.     

A new class of 3-fold perfect splitting authentication codes

Restricted strong partially balanced t-designs were first formulated by Pei, Li, Wang and Safavi-Naini in investigation of authentication codes with arbitration. In this article, we will prove that splitting authentication codes that are multi-fold perfect against spoofing can be characterized in terms of restricted strong partially balanced t-designs. We will also investigate the existence of restricted strong partially balanced 3-designs RSPBD 3-(v, b, 3 × 2; λ₁, λ₂, 1, 0)s, and show that there exists an RSPBD 3-(v, b, 3 × 2; λ₁, λ₂, 1, 0) for any v o 9 (mod 16){v\equiv 9\ (\mbox{{\rm mod}}\ 16)} . As its application, we obtain a new infinite class of 3-fold perfect splitting authentication codes.     

A Construction of Cartesian Authentication Codes from Vector Space and Dual Authentication Codes

ＡＣｏｎｓｔｒｕｃｔｉｏｎｏｆＣａｒｔｅｓｉａｎＡｕｔｈｅｎｔｉｃａｔｉｏｎＣｏｄｅｓｆｒｏｍＶｅｃｔｏｒＳｐａｃｅａｎｄＤｕａｌＡｕｔｈｅｎｔｉｃａｔｉｏｎＣｏｄｅｓＦｅｎｇＲｏｎｇｑｕａｎ（冯荣权）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ...     

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

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

Authentication codes and bipartite graphs

In this paper, a characterization of authentication codes in terms of bipartite graphs is given. By using such a characterization, two necessary and sufficient conditions for a minimal authentication code with perfect secrecy are derived. The probabilities of a successful impersonation and of a successful substitution attack are discussed. As a result, some (optimal) minimal authentication codes with perfect secrecy are constructed from association schemes, from finite groups or from known authentication codes no matter whether the known ones are with or without secrecy.     

Three Constructions of Authentication Codes with Perfect Secrecy

In this paper, we present three algebraic constructions of authentication codes with secrecy. The first and the third class are optimal. Some of the codes in the second class are optimal, and others in the second class are asymptotically optimal. All authentication codes in the three classes provide perfect secrecy.     

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

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

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

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

利用有限域上的向量空间构作带仲裁的认证码

This paper is devoted to constructing an authentication code with arbitration using subspaces of vector spaces over finite fields.Moreover,if we choose the encoding rules of the transmitter and the decoding rules of the receiver according to a uniform probability distribution,then some parameters and the probabilities of successful attacks are computed.     

Systematic authentication codes using additive polynomials

Using additive polynomials related to some curves over finite fields, we construct two families of systematic authentication codes. We use tight bounds for the number of rational points of these curves in estimating the probabilities of the systematic authentication codes. We compare their parameters with some existing codes in the literature. We observe that the parameters are better than the existing ones in some cases.     

Difference packing arrays and systematic authentication codes

In this paper, a type of combinatorial design (called difference packing array) is proposed and used to give a construction of systematic authentication codes. Taking advantage of this construction, some new series of systematic authentication codes are obtainable in terms of existing difference packing arrays.