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

Applied Mathematics & Information Sciences

Post-Quantum Secure Hybrid Signcryption from Lattice Assumption

Fenghe Wang, Yupu Hu, Chunxiao Wang

Published Jan 1, 2012• 18 citations
OpenAlex

Abstract

Motivated by the demand to have secure signcryption scheme, even in quantum era, the concept of signcryption tag-KEM (key encapsulation machine) is extended to lattice cryptography in this paper. A lattice-based hybrid signcryption scheme is proposed by building a lattice-based signcryption tag-KEM. Based on the hardness of the learning with errors problem and the short integer solution problem, the proposed hybrid signcryption is provable secure in the random oracle model. Furthermore, according to the quantum intractability assumption about lattice problem, the proposed hybrid signcryption scheme is secure even on quantum computers.

Related papers

Post-quantum Secure Hybrid Ring Signcryption Scheme from Lattice Assumption

CHunxiao Wang, Fenghe Wang

The signcryption tag-KEM/DEM construction is naturally extended to the ring signcryption in this paper.The security model of hybrid ring signcryption which is constructed by ring signcryption tag-KEM/DEM is given in this paper.A hybrid ring signcryption from lattice theory is proposed which satisfies anonymity and identity authenticity.Moreover, based on the hardness of the learning with errors problem and the short integer solution problem, confidentiality and unforgeability of the proposed scheme is proven in the random oracles model.

International Conference on Computer, Mechatronics, Control and Electronic Engineering•Jan 1, 2015•0 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

Signcryption from NTRU Lattices Without Random Oracles

Ziyuan Liu, Raylin Tso, Yi‐Fan Tseng +1 more

A signcryption scheme provides both the function of digital signature and encryption scheme at the same time. Additionally, it has lower cost than traditional sign-then-encrypt or encrypt-then-sign approaches. Many useful applications have been found where confidentiality and non-repudiation are both required. On the other hand, with the current development of rapid quantum computing, currently schemes based on traditional numerical assumptions (e.g., decisional Diffie-Hellman assumption) are more likely to be attacked by quantum computers. Therefore, lattice-based signcryption schemes have been extensively studied in recent years. However, most of them are either inefficient or secure-proved under the assumptions of random oracles. Although some of them are proved in the standard model, they are not practical in low-cost devices. Since the security is based on "Learning with Errors" (LWE) or "Short Integer Solution" problems, it will result in extremely large size of keys. In this paper, we propose an efficient NTRU-based signcryption scheme, which is inspired from Pion et al.'s key encapsulation mechanism. We provide rigorous security proofs for the confidentiality and unforgeability under NTRU-based assumptions in the standard model. Compared with other schemes, we conclude that our scheme is more efficient and secure.

Asia Joint Conference on Information Security (AsiaJCIS)•Aug 1, 2019•4 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

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

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
Motivated by the demand to have secure signcryption scheme, even in quantum era, the concept of signcryption tag-KEM (key encapsulation machine) is extended to lattice cryptography in this paper. A lattice-based hybrid signcryption scheme is proposed by building a lattice-based signcryption tag-KEM. Based on the hardness of the learning with errors problem and the short integer solution problem, the proposed hybrid signcryption is provable secure in the random oracle model. Furthermore, according to the quantum intractability assumption about lattice problem, the proposed hybrid signcryption scheme is secure even on quantum computers.
The signcryption tag-KEM/DEM construction is naturally extended to the ring signcryption in this paper.The security model of hybrid ring signcryption which is constructed by ring signcryption tag-KEM/DEM is given in this paper.A hybrid ring signcryption from lattice theory is proposed which satisfies anonymity and identity authenticity.Moreover, based on the hardness of the learning with errors problem and the short integer solution problem, confidentiality and unforgeability of the proposed scheme is proven in the random oracles 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.
A signcryption scheme provides both the function of digital signature and encryption scheme at the same time. Additionally, it has lower cost than traditional sign-then-encrypt or encrypt-then-sign approaches. Many useful applications have been found where confidentiality and non-repudiation are both required. On the other hand, with the current development of rapid quantum computing, currently schemes based on traditional numerical assumptions (e.g., decisional Diffie-Hellman assumption) are more likely to be attacked by quantum computers. Therefore, lattice-based signcryption schemes have been extensively studied in recent years. However, most of them are either inefficient or secure-proved under the assumptions of random oracles. Although some of them are proved in the standard model, they are not practical in low-cost devices. Since the security is based on "Learning with Errors" (LWE) or "Short Integer Solution" problems, it will result in extremely large size of keys. In this paper, we propose an efficient NTRU-based signcryption scheme, which is inspired from Pion et al.'s key encapsulation mechanism. We provide rigorous security proofs for the confidentiality and unforgeability under NTRU-based assumptions in the standard model. Compared with other schemes, we conclude that our scheme is more efficient and secure.
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.
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.