International Conference on Communication Networks and Smart Systems Engineering (ICCNSE)
A multi message multi receivers signcryption scheme without trapdoor on the ring
Zhen Liu, Jing-Jing Wang, Hao-Feng Li, Yi-Qun Liu
Abstract
How to construct a multi message multi receiver signcryption scheme for reusing random numbers on a ring is an urgent task to be solved. Based on the LHY20 standard signature scheme and the LHY21 partial random number reuse security theory, For the first time, a multi message multi receiver signature scheme without trapdoors on the ring is constructed. It is proved that the confidentiality and authentication of the scheme under the random oracle model can be reduced to Indistinguishability against Adaptive Chosen Ciphertext Attacks (IND-CCA2) and Strongly Existential Unforgeability against Chosen Message Attacks (SUF-CMA), respectively. In terms of authentication, it is stronger than the multi message multi receiver signature scheme on the LHY21 standard lattice in terms of Existential Unforgeability against Chosen Message Attacks (EUF-CMA). Efficiency analysis shows that compared with the standard signcryption scheme ℰRLWESC, which runs LHY21 independently multiple times, the multi receiver signcryption scheme proposed in this paper reduces ciphertext by nearly 25%. Compared with the multi receiver signcryption scheme on the LHY21 standard lattice, the size of the public and private key in this scheme is reduced from square level to linear level. For a system with n users, it reduces $\tfrac{n - 1}{n} \times 100 \%$ and $\tfrac{n - 3}{n} \times 100 \%$, respectively. The proposed scheme exhibits excellent scalability. For example, when the user scale n>100, the public key size and private key size are reduced by more than 99% and 97%, respectively. This work provides an efficient and scalable post-quantum secure solution for multi-receiver communication scenarios, promotes the practical application of ring-based lattice cryptography in secure multicast systems