Using Symplectic Geometry to Construct Authentication Codes With Arbitration
Li Li · 2006
Unconditionally secure authentication codes with arbitration protects against deceptions from the transmitter and from receives as well as those from the opponent.This paper describes a new construction of authentication codes with arbitration using sympletic geometry over finite fields,and their size parameters are computed.Assuming that the encoding rules one chosen according to a uniform probability distribution,the probabilities of a successful impersonation by the opponent,a successful substitution by the opponent,a successful impersonation by the transmitter,a successful impersonation by the receiver and a successful substitution by the receiver.