JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOM ›› 2017, Vol. 24 ›› Issue (1): 87-95.doi: 10.1016/S1005-8885(17)60191-2

• Others • Previous Articles     Next Articles

Construction of authentication codes with distrust arbitration from polynomials over finite fields

Chen Shangdi, Tian Wenjing, Li Xue   

  1. College of Science, Civil Aviation University of China
  • Received:2016-08-31 Revised:2016-12-27 Online:2017-02-28 Published:2017-02-28
  • Contact: Chen ShangDi
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (61179026), the Fundamental Research Funds for the Central Universities (3122016L005).

Abstract: The authentication codes with arbitration are able to solve dispute between the sender and the receiver. The authentication codes with trusted arbitration are called , the authentication codes with distrust arbitration are called . As an expansion of , an is an authentication system which is closer to the reality environment. Therefore, have more extensive application value. In this paper, we construct a class of based on polynomials over finite fields, give the parameters of the constructed codes, and calculate a variety of cheating attacks the maximum probabilities of success. Especially, in a special case, the constructed are perfect. Compared with a known type of codes, they have almost the same security level, however, our codes need less storage requirements. Therefore, our codes have more advantages.

Key words: authentication code, distrust arbitration, polynomial, finite field, perfect