A New Authentication Codes With Arbitration From Symplectic Geometry Over Finite Fields

Unconditionally secure authentication codes with arbitration protects against decep-tions from the transmitter and the receiver as well as those from the opponent. This paper describes a new construction of authentication codes with arbitration using sym-plectic geometry over finite fields. And their size parameters are computed.We also have results as follows:the probabilities of a successful impersonation by the opponentthe probabilities of a successful substitution by the opponentthe probabilities of a successful impersonation by the transmitterthe probabilities of a successful impersonation by the receiverthe probabilities of a successful substitution by the receiver...