A New Construction of the Authentication Codes with Arbitration from Singular Symplectic Geometry over the Finite Fields
You Gao, Huo Li-qun · Gongcheng shuxue xuebao · 2011
The authentication codes with arbitration can deal with the distrust problem of the trans-mitter,the receiver and the opponent in the communications system.In this paper,a new construction of the authentication codes with arbitration from subspaces of singular symplectic geometry over the finite fields is presented.The parameters of the code are computed by the method of the matrix and the combinatorial enumeration.The transmitter’s encoding rules and the receiver’s decoding rules are chosen according to a uniform probability distribution.PI,PS,PT,PR0 and PR1 denote the largest probabilities of the successful impersonation attack and the successful substitution attack of the oppo-nent,the successful impersonation attack of the transmitter,the successful impersonation attack and the successful substitution attack of receiver,respectively.Then the probabilities of five attacks for the construction of the authentication codes with arbitration are computed.