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 ELECTRONICS INFORMATION TECHNOLOGY

A Lattice-based Signcryption Scheme Without Trapdoors

LU Xiu-hua, Wen Qiao-yan, Licheng Wang, Du Jiao

Published Sep 19, 2016• 7 citations
Publisher

Abstract

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.

DOI
10.11999/jeit151044

Related papers

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

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

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

Lattice‐based signcryption

Fagen Li, Fahad T. Bin Muhaya, Muhammad Khurram Khan +1 more

SUMMARY Signcryption is a cryptographic primitive that performs simultaneously both the functions of digital signature and public‐key encryption, at a cost significantly lower than that required by the traditional signature‐ then‐encryption approach. In this paper, we provide a positive answer to the question of if it is possible to construct signcryption based on lattice problems. More precisely, we design an efficient signcryption scheme that can send a message of length l one time. We prove that the proposed scheme has the indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption and strong unforgeability against adaptive chosen messages attacks under the inhomogeneous small integer solution assumption in the random oracle model. Copyright © 2012 John Wiley & Sons, Ltd.

Concurrency and Computation Practice and Experience•Feb 20, 2012•30 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

An Efficient Lattice-Based Proxy Signature Scheme without Trapdoor

Chunli Yang, Peigang Qiu, Shihui Zheng +1 more

Lattice-based proxy signature is a kind of signature that can resist the known quantum attack and a special digital signature which has the proxy functionality. So far, as far as I know, all lattice-based proxy signatures that use the "hash-and-sign" method of GPV08 signature are low efficient due to the time-consuming preimage sampleable algorithm. Based on the rejection sampling technique of Lyu12 signature, we proposed an efficient lattice-based proxy signature scheme without trapdoor, and the formal security proof of existentially unforgeable is given in random oracle model. In addition, the length of keys and signature in our scheme are shorter than all existing lattice-based proxy signature schemes, and the computations are also small.

International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)•Sep 1, 2015•9 citations
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.
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.
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 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.
SUMMARY Signcryption is a cryptographic primitive that performs simultaneously both the functions of digital signature and public‐key encryption, at a cost significantly lower than that required by the traditional signature‐ then‐encryption approach. In this paper, we provide a positive answer to the question of if it is possible to construct signcryption based on lattice problems. More precisely, we design an efficient signcryption scheme that can send a message of length l one time. We prove that the proposed scheme has the indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption and strong unforgeability against adaptive chosen messages attacks under the inhomogeneous small integer solution assumption in the random oracle model. Copyright © 2012 John Wiley & Sons, Ltd.
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.
Lattice-based proxy signature is a kind of signature that can resist the known quantum attack and a special digital signature which has the proxy functionality. So far, as far as I know, all lattice-based proxy signatures that use the "hash-and-sign" method of GPV08 signature are low efficient due to the time-consuming preimage sampleable algorithm. Based on the rejection sampling technique of Lyu12 signature, we proposed an efficient lattice-based proxy signature scheme without trapdoor, and the formal security proof of existentially unforgeable is given in random oracle model. In addition, the length of keys and signature in our scheme are shorter than all existing lattice-based proxy signature schemes, and the computations are also small.