Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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

Published Jun 1, 2026• 0 citations
Publisher

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

DOI
10.1109/iccnse70788.2026.11636089

Related papers

Efficient multi-receiver identity-based signcryption from lattice assumption

Xiaojun Zhang, Chunxiang Xu, Jingting Xue

Signcryption is a public-key cryptographic primitive which combines the functions of public-key encryption and digital signature into a single logical step at low computational and communication costs. While multi-receiver signcryption is suited for a situation where a sender wants to send a signcrypted message to multiple receivers in a confidential and authenticated way. Due to this attractive property, recently, multi-receiver signcryption plays an important role in some practical applications such as virtual conference as well as authenticated mail transferring. In this paper, we present an efficient multi-receiver identity-based signcryption (MIBSC) scheme from lattice assumption which is believed to resist quantum computer attacks. The proposed scheme is provably secure in the random oracle model, which has the indistinguishability against chosen ciphertext attacks under the hardness of learning with errors (LWE), and existentially unforgeability against chosen message attacks under the small integer solution assumption (SIS). Moreover, we also compare our MIBSC scheme with existing schemes from performance efficiency and security, the result shows that our proposed scheme is more efficient and more secure. In particular, our scheme can be properly applied in the post-quantum communication environments.

International Journal of Electronic Security and Digital Forensics•Dec 19, 2017•16 citations

A Lattice-Based Multi-Receiver Signcryption Scheme for Point to Multi-Point Communication

Xiuhua Lu, Qiaoyan Wen, Licheng Wang +1 more

In order to guarantee information confidentiality and authentication in point to multi-point communication mode, we propose the first secure multi-receiver signcryption scheme based on lattice. We prove that our scheme achieves the indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption and existential unforgeability against adaptive chosen message attacks under the inhomogeneous small integer solution assumption. Our scheme resists the existing quantum algorithm analysis, since we construct it in lattice-based cryptography.

International Conference on Information and Network Security (ICINS)•Jan 1, 2013•1 citation

Heterogeneous hybrid signcryption for multi-message and multi-receiver

Shufen Niu, Niu Ling, Xiyan Yang +2 more

To achieve secure communication in heterogeneous cryptography systems, we present a heterogeneous hybrid signcryption scheme. The proposed scheme allows a sender in an identity-based cryptography system to send multi-message to multi-receiver in a certificateless cryptography system with different master keys. At the same time, all users are mapped to a distinct pseudo-identity for conditional identity privacy preservation. A trusted authority could trace the real identity when necessary. Compared with existing schemes, the proposed scheme is more practical for actual applications. In addition, the proposed scheme has indistinguishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen message attacks under the random oracle model.

PLoS ONE•Sep 8, 2017•22 citations

Improved Lattice-Based Signcryption in the Standard Model

Xiaopeng Yang, Hao Cao, Weichun Li +1 more

Signcryption is a basic cryptographic primitive that simultaneously captures the functions of encryption and signature. To realize comprehensive information security against quantum computing attacks, lattice-based signcryption schemes have been successively proposed. However, the performance of signcryption schemes should be improved in the lattice setting. An efficient lattice-based signcryption scheme in the standard model is proposed in this paper. Under the ring learning with errors (RLWE) assumption and the ideal short integer solution (ISIS) assumption, the proposed signcryption scheme achieves indistinguishability against adaptive chosen ciphertext attacks (IND-CCA2) and existential unforgeability under an adaptive chosen-message attack (EUF-ACMA). Our scheme not only reduces the communication and computational overhead but also realizes a new design that combines the partitioning technique with the idea of tag-based key encapsulation. The performance analysis results show that our scheme is more efficient than previous lattice-based signcryption schemes in the standard model.

IEEE Access•Jan 1, 2019•15 citations

A Lattice-based Signcryption Scheme Without Trapdoors

LU Xiu-hua, Wen Qiao-yan, Licheng Wang +1 more

The existing lattice-based signcryption schemes are based on trapdoor generation algorithm and preimage sample algorithm. However, both algorithms are complex, require a lot of time to run, and affect the efficiency of latticed-based signcryption schemes deeply. To solve this problem, the first lattice-based signcryption scheme without trapdoor generation algorithm and preimage sample algorithm is proposed, with the help of the technique of lattice signatures without trapdoors and the associated signature compression technique, as well as the encryption method based on the learning with errors assumption. The scheme achieves indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption. It also achieves existential unforgeability against adaptive chosen message attacks under the small integer solution assumption. The proposed scheme is not only quantum resistant, but also efficient.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Sep 19, 2016•7 citations

Reconciling and improving of multi‐receiver signcryption protocols with threshold decryption

Mingwu Zhang, Bo Yang, Tsuyoshi Takagi

ABSTRACT Signcryption is a cryptographic primitive that offers both confidentiality and authentication simultaneously, which combines the functionalities of signature and encryption in a provably secure manner. Indistinguishability against adaptive chosen‐ciphertext attacks (ind‐cca2) and unforgeability against adaptive chosen‐message attacks (euf‐cma2) are two important security requirements of a signcryption protocol. In a multi‐receiver signcryption with a threshold decryption scheme, the ciphertext can be decrypted and verified when arbitrary t or more receivers among the n candidate decrypters work together. Recently, Qin et al. [Security and Communication Networks, 2011] proposed an identity‐based multi‐receiver signcryption scheme with threshold decryption, and they declared that the scheme achieves ind‐cca2 and euf‐cma2 security. In this paper, we first indicate that Qin et al.'s scheme is not secure, that is, Qin et al.'s scheme is neither semantically secure against ind‐cca2 nor unforgeable against euf‐cma2. After that, we present an improved scheme to capture the security requirements. Furthermore, we construct an anonymous version that can preserve the identity privacy of the sender and receiver, and we give the performance evaluation to indicate that our scheme has lower communication overhead although it provides the identity privacy preservation. Copyright © 2012 John Wiley & Sons, Ltd.

Security and Communication Networks•Feb 24, 2012•6 citations
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 n−1n×100%\tfrac{n - 1}{n} \times 100 \%nn−1​×100% and n−3n×100%\tfrac{n - 3}{n} \times 100 \%nn−3​×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
Signcryption is a public-key cryptographic primitive which combines the functions of public-key encryption and digital signature into a single logical step at low computational and communication costs. While multi-receiver signcryption is suited for a situation where a sender wants to send a signcrypted message to multiple receivers in a confidential and authenticated way. Due to this attractive property, recently, multi-receiver signcryption plays an important role in some practical applications such as virtual conference as well as authenticated mail transferring. In this paper, we present an efficient multi-receiver identity-based signcryption (MIBSC) scheme from lattice assumption which is believed to resist quantum computer attacks. The proposed scheme is provably secure in the random oracle model, which has the indistinguishability against chosen ciphertext attacks under the hardness of learning with errors (LWE), and existentially unforgeability against chosen message attacks under the small integer solution assumption (SIS). Moreover, we also compare our MIBSC scheme with existing schemes from performance efficiency and security, the result shows that our proposed scheme is more efficient and more secure. In particular, our scheme can be properly applied in the post-quantum communication environments.
In order to guarantee information confidentiality and authentication in point to multi-point communication mode, we propose the first secure multi-receiver signcryption scheme based on lattice. We prove that our scheme achieves the indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption and existential unforgeability against adaptive chosen message attacks under the inhomogeneous small integer solution assumption. Our scheme resists the existing quantum algorithm analysis, since we construct it in lattice-based cryptography.
To achieve secure communication in heterogeneous cryptography systems, we present a heterogeneous hybrid signcryption scheme. The proposed scheme allows a sender in an identity-based cryptography system to send multi-message to multi-receiver in a certificateless cryptography system with different master keys. At the same time, all users are mapped to a distinct pseudo-identity for conditional identity privacy preservation. A trusted authority could trace the real identity when necessary. Compared with existing schemes, the proposed scheme is more practical for actual applications. In addition, the proposed scheme has indistinguishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen message attacks under the random oracle model.
Signcryption is a basic cryptographic primitive that simultaneously captures the functions of encryption and signature. To realize comprehensive information security against quantum computing attacks, lattice-based signcryption schemes have been successively proposed. However, the performance of signcryption schemes should be improved in the lattice setting. An efficient lattice-based signcryption scheme in the standard model is proposed in this paper. Under the ring learning with errors (RLWE) assumption and the ideal short integer solution (ISIS) assumption, the proposed signcryption scheme achieves indistinguishability against adaptive chosen ciphertext attacks (IND-CCA2) and existential unforgeability under an adaptive chosen-message attack (EUF-ACMA). Our scheme not only reduces the communication and computational overhead but also realizes a new design that combines the partitioning technique with the idea of tag-based key encapsulation. The performance analysis results show that our scheme is more efficient than previous lattice-based signcryption schemes in the standard model.
The existing lattice-based signcryption schemes are based on trapdoor generation algorithm and preimage sample algorithm. However, both algorithms are complex, require a lot of time to run, and affect the efficiency of latticed-based signcryption schemes deeply. To solve this problem, the first lattice-based signcryption scheme without trapdoor generation algorithm and preimage sample algorithm is proposed, with the help of the technique of lattice signatures without trapdoors and the associated signature compression technique, as well as the encryption method based on the learning with errors assumption. The scheme achieves indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption. It also achieves existential unforgeability against adaptive chosen message attacks under the small integer solution assumption. The proposed scheme is not only quantum resistant, but also efficient.
ABSTRACT Signcryption is a cryptographic primitive that offers both confidentiality and authentication simultaneously, which combines the functionalities of signature and encryption in a provably secure manner. Indistinguishability against adaptive chosen‐ciphertext attacks (ind‐cca2) and unforgeability against adaptive chosen‐message attacks (euf‐cma2) are two important security requirements of a signcryption protocol. In a multi‐receiver signcryption with a threshold decryption scheme, the ciphertext can be decrypted and verified when arbitrary t or more receivers among the n candidate decrypters work together. Recently, Qin et al. [Security and Communication Networks, 2011] proposed an identity‐based multi‐receiver signcryption scheme with threshold decryption, and they declared that the scheme achieves ind‐cca2 and euf‐cma2 security. In this paper, we first indicate that Qin et al.'s scheme is not secure, that is, Qin et al.'s scheme is neither semantically secure against ind‐cca2 nor unforgeable against euf‐cma2. After that, we present an improved scheme to capture the security requirements. Furthermore, we construct an anonymous version that can preserve the identity privacy of the sender and receiver, and we give the performance evaluation to indicate that our scheme has lower communication overhead although it provides the identity privacy preservation. Copyright © 2012 John Wiley & Sons, Ltd.