利用强部分平衡t-设计构造分裂认证码

doi:10.3969/j.issn.0255-8297.2020.06.017

Abstract

Abstract: In this paper, we propose a restricted strongly partially-balanced t-design in a finite two-dimension vector space, and construct a perfect splitting authentication code on the basis of this design. First, based on the theory of equations, a strongly partially-balanced t-design is constructed, and directly one type of splitting authentication codes is obtained. Second, one more type of authentication codes is generated by adding constraints to the above construction process. The two types of codes are proved perfect on splitting authentication by calculating their r-order probabilities of successful spoofing attacks respectively. Finally, the performances of two types of codes are analyzed. By simulations with a specific example, the rationality and validity of the construction approaches are verified. Compared with previous works, it is concluded that in this method, the successful probability of each order deception attack could reach the minimum by using large number of sources, and that the coding algorithm and simulation are easy to implement due to its simple theoretical basis. Therefore, the code constructed in this paper is competitive in terms of amount of transmitting information, security and practicability.

Key words: splitting authentication code, partially balanced t-design, restricted strongly partially balanced t-design, finite field, vector space

CLC Number:

O157.4

WANG Xiuli, CAO Miao, WANG Lina. Construction of Splitting Authentication Codes Using Strongly Partially Balanced t-Design[J]. Journal of Applied Sciences, 2020, 38(6): 1006-1016.

References

[1] Shannon C E. Communication theory of secrecy system[J]. Bell System Technical Journal, 1949, 28:656-715.
[2] Simmons G J. Authentication theory/coding theory[C]//Workshop on the Theory and Application of Cryptographic Techniques:Proceedings of CRYPTO 84, 1984:411-431.
[3] Gilbert E N, MacWillams F J, Sloane N J A. Codes which detect deception[J]. Bell System Technical Journal, 1974, 53:405-424.
[4] 邱双月. 利用有限域上奇异酉空间构作Cartesian认证码[J]. 河北师范大学学报(自然科学版), 2014, 5:439-444. Qiu S Y. A construction of Cartesian authentication code from singular unitary space a finite field[J]. Journal of Hebei Normal University (Natural Science Edition), 2014, 5:439-444. (in Chinese)
[5] 邱双月, 刘文菡,张更生. 利用有限域上δ为1 的奇异酉空间构作Cartesian认证码[J]. 数学的实践与认识, 2015, 45(11):313-316. Qiu S Y, Liu W H, Zhang G S. A construction of Cartesian authentication code from singular unitary space over the finite filed δ=1[J]. Mathematics in Practice and Theory, 2015, 45(11):313-316. (in Chinese)
[6] Chen S D, Tian W J. Construction of authentication codes with distrust arbitration from unitary geometry[J]. Journal of Combinatorial Mathematics and Combinatorial Computing, 2018, 105:131-145.
[7] 李殿龙. 基于矩阵方法的Cartesian认证码构造[J]. 计算机工程, 2010, 36(12):162-166. Li D L. Construction of Cartesian authentication code based on matrices method[J]. Computer Engineering, 2010, 36(12):162-166. (in Chinese)
[8] 裴定一. 消息认证码[M]. 合肥:中国科学技术大学出版社,2009.
[9] Pei D Y. Authentication codes and combinatorial designs[M]. Boca Raton London New York:Taylor & Francis Group, 2006.
[10] Safavi-Naini R, Tonien D, Wild P R. Authentication codes in the query model[J]. Coding and Cryptology, 2008:214-225.
[11] 王永传. 由分裂认证码构造有仲裁认证码[J]. 通信保密, 1999(3):46-49. Wang Y C. Constructions of authentication codes with arbitration from splitting authentication coeds[J]. Communication Security, 1999(3):46-49. (in Chinese)
[12] Simmons G J. A game theory model of digital message authentication[J]. Journal of Crytology, 1982, 43:413-424.
[13] 王永传, 杨义先. 分裂认证码与纠错码[J]. 通信保密, 1999(1):64-66. Wang Y C, Yang Y X. Splitting authentication codes with and error-correcting codes[J]. Communication Security, 1999(1):64-66. (in Chinese)
[14] 王永传, 杨义先. 一类分裂的Cartesian认证码的构造[J]. 通信保密, 1997(4):48-51. Wang Y C, Yang Y X. Constructions of a class of splitting Cartesian authentication codes[J]. Communication Security, 1997(4):48-51. (in Chinese)
[15] Huber M. Combinatorial bounds and characterizations of splitting authentication codes[J]. Cryptography and Communications, 2010, 2:173-185.
[16] Kurosawa K, Obana S. Combinatorial bounds on authentication codes with arbitration[J]. Designs, Codes and Cryptography, 2001, 22(3):265-281.
[17] Pei D Y, Li Y Q, Wang Y J. et al. Characterization of optimal authentication codes with arbitration[J]. Lecture Notes in Computer Science, 1999, 1587:303-313.
[18] Ogata W, Kurosawa K, Stinson D R, et al. New combinatorial designs and their applications to authentication codes and secret sharing schemes[J]. Discrete Mathematics, 2004, 279:383-405.
[19] Liang M, Du B L. A new class of 3-fold perfect splitting authentication codes[J]. Designs, Codes and Cryptography, 2012, 62:109-119.
[20] Chen S D, Zhang X L. Three constructions of perfect authentication codes from projective geometry over finite fields[J]. Applied Mathematics and Computation, 2015, 253:308-317.
[21] Matsubara K, Sawa M, Kageyama S. Existence on splitting-balanced block designs with resolvability[J]. Graphs and Combinatorics, 2017, 33:561-572.
[22] Liang M, Ji L, Zhang J. Some new classes of 2-fold optimal or perfect splitting authentication codes[J]. Cryptography and Communications, 2017, 9:407-430.
[23] Li M C, Liang M, Du, B L, et al. A construction for optimal c-splitting authentication and secrecy codes[J]. Designs, Codes and Cryptography, 2018, 86:1739-1755.
[24] 王利娜.基于有限域几何空间和组合设计构造认证码[D].天津:中国民航大学,2017.

Construction of Splitting Authentication Codes Using Strongly Partially Balanced t-Design

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 2

Recommended Articles

Metrics

Comments

[1]	YUAN Dan-shou, RONG Meng-tian, LI Xin-tian. Serial Circuit Architecture for Power-Sum in GF(2^m) [J]. Journal of Applied Sciences, 2006, 24(2): 111-114.
[2]	LU ZIYI, YANG LÜ XI, HE ZHENYA. Unified Model and Analysis of a Class of Adaptive ⅡR Filters [J]. Journal of Applied Sciences, 1998, 16(3): 262-268.