Abstract
Authentication is an important primitive of cryptography. With the rapid progress of network communication, the urgent data needs to ensure it integrity and privacy, therefore, the authentication of multi-receiver has a significant impact on the development of network interaction. R. Safavi-Nalni and H. Wang showed that authentication scheme based on Reed-Solomon code is unconditionally secure and allows multiple messages to be authenticated, but the number of receiver to verify is less than $q$ , where the messages are in $\mathbb {F}_{q}$ . In 2014, the secure multi-receiver authentication scheme base on linear code was proposed, however, this scheme can not realize any a given access structure. In this paper, we present a multi-receiver authentication scheme to realize any a given ideal access structure, and demonstrate that our scheme is unconditionally secure and allows $r$ messages to be authenticated with each receiver own private key.
Highlights
Authentication [9], [10] is an important primitive of cryptography
The scheme is unconditionally secure and allows r messages to be authenticated with each receiver own private key
Zhang et al [8] constructed multi-receiver authentication scheme based on generalization linear code, it allows arbitrarily many receivers to check the integrity of messages, and the minimal group of receivers that can successfully make a substitution attack is determined by the minimal codeword of the dual code
Summary
Authentication [9], [10] is an important primitive of cryptography. The difference between authentication scheme and encryption scheme is that encryption scheme pays more attention to data privacy [11], [12], while authentication scheme [13], [14] is more attention to the integrity of data. Safavi-Naini and Wang [6] extended the DFY scheme [2] to be an authentication scheme of multiple messages for multi-receivers based on the idea of Shamir’s secret sharing. Zhang et al [8] constructed multi-receiver authentication scheme based on generalization linear code, it allows arbitrarily many receivers to check the integrity of messages, and the minimal group of receivers that can successfully make a substitution attack is determined by the minimal codeword of the dual code.
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
