A New Construction of Multisender Authentication Codes from Symplectic Geometry over Finite Fields

Multisender authentication codes allow a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message. In this paper, we give the model of multisender authentication codes and the calculation formulas on probability of success in attacks by malicious groups of senders. A construction of multisender authentication codes from symplectic geometry over finite fields is given, and the parameters and the probabilities of deceptions are also calculated.