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 High Speed Networks

A lattice-based efficient heterogeneous signcryption scheme for secure network communications

Siqi Yu, Mengxue Shang, Fengyin Li

Published Aug 25, 2023• 1 citation
Publisher

Abstract

Ensuring the security of transmitted content is an important task in network communication. Signcryption technology combines signature and encryption operations in a single step to achieve message authentication and confidentiality. In practical applications, users are usually in different cryptographic systems, the ordinary signcryption technology cannot realize communication between two different cryptographic systems. And the ciphertext structure of the existing signcryption schemes is relatively complex, signcryption is not efficient. Therefore, in order to solve the problem of efficient communication between different cryptosystems and ensure quantum security, this paper proposes a lattice-based efficient heterogeneous signcryption scheme for secure network communications. This signcryption scheme accomplishes signcryption through matrix operations and hash functions, which avoids complex signcryption structures, efficiently realizes bidirectional message communication between identity-based cryptosystems and certificateless cryptosystems.

DOI
10.3233/jhs-222020

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

An Efficient Identity-based Signcryption from Lattice

Xiufeng Zhao, Xiang Wang

Signcryption is a cryptographic primitive that can provide valid solution for authentication and confidentiality.In this paper, an efficient identity-based signcryption scheme from lattice was proposed.Our scheme based on Macciancio and Piekert's trapdoor generation method and delegate algorithm for lattice.Our main idea is that establish the identity-based system master key via trapdoor generation method for lattice, and extract user's key by trapdoor delegate algorithm.With the aid of random oracle, we prove that the proposed scheme has CCA security under the learning with errors (LWE) assumption and unforgeability against adaptive chosen messages attacks under the small integer solution (SIS) assumption.Comparison with signature-then-encryption approach shows that our scheme is efficient.

International Journal of Security and Its Applications•Mar 31, 2014•3 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

Quantum Signcryption: A Hybrid Quantum-Resistant Secure Communication System

Danya Al-Jubouri, Qasem S. Abu Al-Haija

With the fast advancement in quantum computing, conventional cryptography is facing great challenges, with quantum algorithms like Shor’s algorithm and Grover’s algorithm threatening to break most widely used cryptosystems and hashing algorithms. Cryptosystems that use public-key cryptography, such as RSA, have proven vulnerable to quantum attacks. This presents a high threat to digital communication, as it can compromise modern communication systems’ confidentiality, authenticity, and integrity. On the other hand, modern cryptosystems treat digital signatures and encryption as two separate operations, adopting the sign-then-encrypt method for securing communication, which results in significant computational cost and overhead. This paper proposes a Quantum Signcryption tool to solve these problems, offering a system enhanced by quantum technology and secured against quantum threats. This system combines the functions of encryption and digital signatures into a single process to function as an efficient and secure tool for future quantum communication, with an average end-to-end execution time of 20.615s, consuming 11092 KBs of memory.

International Conference on Information and Communication Systems (ICICS)•May 18, 2026•0 citations
Ensuring the security of transmitted content is an important task in network communication. Signcryption technology combines signature and encryption operations in a single step to achieve message authentication and confidentiality. In practical applications, users are usually in different cryptographic systems, the ordinary signcryption technology cannot realize communication between two different cryptographic systems. And the ciphertext structure of the existing signcryption schemes is relatively complex, signcryption is not efficient. Therefore, in order to solve the problem of efficient communication between different cryptosystems and ensure quantum security, this paper proposes a lattice-based efficient heterogeneous signcryption scheme for secure network communications. This signcryption scheme accomplishes signcryption through matrix operations and hash functions, which avoids complex signcryption structures, efficiently realizes bidirectional message communication between identity-based cryptosystems and certificateless cryptosystems.
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.
Signcryption is a cryptographic primitive that can provide valid solution for authentication and confidentiality.In this paper, an efficient identity-based signcryption scheme from lattice was proposed.Our scheme based on Macciancio and Piekert's trapdoor generation method and delegate algorithm for lattice.Our main idea is that establish the identity-based system master key via trapdoor generation method for lattice, and extract user's key by trapdoor delegate algorithm.With the aid of random oracle, we prove that the proposed scheme has CCA security under the learning with errors (LWE) assumption and unforgeability against adaptive chosen messages attacks under the small integer solution (SIS) assumption.Comparison with signature-then-encryption approach shows that our scheme is efficient.
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.
With the fast advancement in quantum computing, conventional cryptography is facing great challenges, with quantum algorithms like Shor’s algorithm and Grover’s algorithm threatening to break most widely used cryptosystems and hashing algorithms. Cryptosystems that use public-key cryptography, such as RSA, have proven vulnerable to quantum attacks. This presents a high threat to digital communication, as it can compromise modern communication systems’ confidentiality, authenticity, and integrity. On the other hand, modern cryptosystems treat digital signatures and encryption as two separate operations, adopting the sign-then-encrypt method for securing communication, which results in significant computational cost and overhead. This paper proposes a Quantum Signcryption tool to solve these problems, offering a system enhanced by quantum technology and secured against quantum threats. This system combines the functions of encryption and digital signatures into a single process to function as an efficient and secure tool for future quantum communication, with an average end-to-end execution time of 20.615s, consuming 11092 KBs of memory.