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

Journal of King Saud University - Computer and Information Sciences

Certificateless multi-source signcryption with lattice

Huifang Yu, Jiafeng Shi

Published Oct 25, 2022• 8 citations
Publisher

Abstract

Network coding can improve network transmission performance and reduce data transmission delay. However, the nodes in network are vulnerable to pollution attacks. Previous network coding schemes are based on difficult problems in number theory and cannot resist the quantum computing attacks. Hence, certificateless multi-source signcryption with lattice (LCL-MSSC) is devised for network coding, it uses common public key to verify the combination ciphertext from different source node users. Based on learning with errors and inhomogeneous small integer solution problems, LCL-MSSC is unforgeable under the adaptive chosen-message attacks and indistinguishable under the adaptive chosen-ciphertext attacks; in addition, it can resist the pollution attacks and quantum computing attacks. Efficient LCL-MSSC has broad application prospect in UAV wireless communication network, mobile wireless network, wireless sensor network or cyberspace security.

DOI
10.1016/j.jksuci.2022.10.013

Related papers

Certificateless Signcryption Scheme From Lattice

Huifang Yu, Lu Bai, Ming Hao +1 more

Certificateless signcryption can simultaneously provide certificateless signature and encryption. In recent years, many certificateless signcryption schemes have been proposed. However, these schemes are based on traditional mathematical theory and not have the ability of resisting the quantum computing attacks. Up to now, lattice-based certificateless signature or encryption schemes have been proposed; however, these schemes only have one function and cannot fulfill two functions of certificateless signature and encryption at the same time. In consideration of this reason, in this article, a certificateless signcryption scheme from lattice (L-CLSS) is constructed. L-CLSS has three advantages. First, in the random oracle model, it is provably indistinguishable against adaptive ciphertext-chosen attacks under the intractability of the learning with errors (LWE) problem and unforgeable against adaptive message-chosen attacks under the hardness of small integer solution (SIS) problem. Second, comparison with the cryptographic algorithms under the difficulty of large integer decomposition, L-CLSS can resist the quantum computing attacks. Third, L-CLSS has higher computation efficiency and a lower communication cost than the existing schemes.

IEEE Systems Journal•Jul 17, 2020•22 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

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•5 citations

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•Jan 1, 2018•13 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

Certificateless threshold signature from lattice

Huifang Yu, Qi Zhang

Threshold signature has been widely used in electronic wills, electronic elections, cloud computing, secure multi-party computation and other fields. Until now, certificateless threshold signature schemes are all based on traditional mathematic theory, so they cannot resist quantum computing attacks. In view of this, we combine the advantages of lattice-based cryptosystem and certificateless cryptosystem to construct a certificateless threshold signature from lattice (LCLTS) that is efficient and resistant to quantum algorithm attacks. LCLTS has the threshold characteristics and can resist the quantum computing attacks, and the analysis shows that it is unforgeable against the adaptive Chosen-Message Attacks (UF-CMA) with the difficulty of Inhomogeneous Small Integer Solution (ISIS) problem. In addition, LCLTS solves the problems of the certificate management through key escrow.

Digital Communications and Networks•Nov 10, 2022•2 citations
Network coding can improve network transmission performance and reduce data transmission delay. However, the nodes in network are vulnerable to pollution attacks. Previous network coding schemes are based on difficult problems in number theory and cannot resist the quantum computing attacks. Hence, certificateless multi-source signcryption with lattice (LCL-MSSC) is devised for network coding, it uses common public key to verify the combination ciphertext from different source node users. Based on learning with errors and inhomogeneous small integer solution problems, LCL-MSSC is unforgeable under the adaptive chosen-message attacks and indistinguishable under the adaptive chosen-ciphertext attacks; in addition, it can resist the pollution attacks and quantum computing attacks. Efficient LCL-MSSC has broad application prospect in UAV wireless communication network, mobile wireless network, wireless sensor network or cyberspace security.
Certificateless signcryption can simultaneously provide certificateless signature and encryption. In recent years, many certificateless signcryption schemes have been proposed. However, these schemes are based on traditional mathematical theory and not have the ability of resisting the quantum computing attacks. Up to now, lattice-based certificateless signature or encryption schemes have been proposed; however, these schemes only have one function and cannot fulfill two functions of certificateless signature and encryption at the same time. In consideration of this reason, in this article, a certificateless signcryption scheme from lattice (L-CLSS) is constructed. L-CLSS has three advantages. First, in the random oracle model, it is provably indistinguishable against adaptive ciphertext-chosen attacks under the intractability of the learning with errors (LWE) problem and unforgeable against adaptive message-chosen attacks under the hardness of small integer solution (SIS) problem. Second, comparison with the cryptographic algorithms under the difficulty of large integer decomposition, L-CLSS can resist the quantum computing attacks. Third, L-CLSS has higher computation efficiency and a lower communication cost than the existing schemes.
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.
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.
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.
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.
Threshold signature has been widely used in electronic wills, electronic elections, cloud computing, secure multi-party computation and other fields. Until now, certificateless threshold signature schemes are all based on traditional mathematic theory, so they cannot resist quantum computing attacks. In view of this, we combine the advantages of lattice-based cryptosystem and certificateless cryptosystem to construct a certificateless threshold signature from lattice (LCLTS) that is efficient and resistant to quantum algorithm attacks. LCLTS has the threshold characteristics and can resist the quantum computing attacks, and the analysis shows that it is unforgeable against the adaptive Chosen-Message Attacks (UF-CMA) with the difficulty of Inhomogeneous Small Integer Solution (ISIS) problem. In addition, LCLTS solves the problems of the certificate management through key escrow.