Construction of Authentication Codes with Double Arbiters over Symplectic Geometry

In a common authentication code with arbitration, the dishonest arbiter may make a threat to the security of authentication system. In this paper, an authentication code with double arbiters over symplectic geometry is constructed, and the relevant parameters and the probabilities of successful attacks are calculated. The model not only prevents deception from the opponent and members of the system, but also effectively limits the attacks of single arbiter. Moreover, the collusion attacks from arbiters and participators are difficult to succeed.