摘要

Multi-sender authentication codes are always viewed as an extension of the traditional point-to-point message authentication. Multi-sender authentication codes allow a group of senders to construct an authenticated message such that the receiver can verify the authenticity of the received message. In this paper, a new construction of multi-sender authentication code from singular pseudo-symplectic geometry over finite fields is put forward. Both the parameters and the probabilities of successful deceptions from a part of senders are computed by the method of matrices and combinatorial enumeration. Finally, we appropriately adjust the parameters of our scheme for achieving the optimum case.

全文