Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Applicable Algebra in Engineering, Communication and Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
