.png){kind=icon}
.png){kind=icon}
Return
Multi-Receiver Authentication Scheme for General Access Structure
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2965732.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 Fq. 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 multireceiver 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.
Keywords:
Multi-receiver authentication scheme
access structure
adversary structure
linear code
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.