A New Construction of Multi-sender Authentication Codes from Polynomials over Finite Fields

Abstract

Multi-sender 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 construct one multi-sender authentication codes from
polynomials over finite fields. Some parameters and the probabilities of deceptions of this codes are also computed.