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 Computer, Mechatronics, Control and Electronic Engineering

Post-quantum Secure Hybrid Ring Signcryption Scheme from Lattice Assumption

CHunxiao Wang, Fenghe Wang

Published Jan 1, 2015• 1 citation
Publisher

Abstract

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.

DOI
10.2991/iccmcee-15.2015.180

Related papers

Post-Quantum Secure Hybrid Signcryption from Lattice Assumption

Fenghe Wang, Yupu Hu, Chunxiao Wang

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.

Applied Mathematics & Information Sciences•Jan 1, 2012•18 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•Dec 19, 2017•16 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

An Efficient and Secure Undeniable Signature Scheme based on Ring Learning with Error

Akanksha Singh, Harish Chandra, Saurabh Rana

This paper, proposes a novel undeniable signature scheme based on the ring learning with errors (RLWE) problem, a complex lattice problem. In our scheme, authentic signatures can be validated via an interactive protocol, which guarantees that adversaries cannot forge signatures. Moreover, it ensures that honest participants consistently finish the verification procedure. Thus, the scheme is a strong and effective quantum-resistant undeniable signature scheme. Our security analysis, demonstrates resilience against both classical and quantum adversaries, based on the RLWE problem's hardness assumptions. Additionally, the random Oracle model is utilised to evaluate our protocol's security, showing that our scheme satisfies important cryptographic properties like completeness, soundness, and unforgeability. Our work advances the feasibility of post-quantum undeniable signature schemes for real-world cryptographic applications.

International Journal of Ad Hoc and Ubiquitous Computing•Jan 1, 2026•1 citation

Identity-based Linkable Ring Signcryption on NTRU Lattice

Xiaofang Huang

Although the current lattice-based ring signcryption scheme resists quantum attacks,it has large key storage and high encryption/decryption time.The linkable lattice ring signcryption scheme not only can protect signer anonymity,but also can determine whether two signatures are generated by the same signer.Thus,based on the compact Gaussian sampling algorithm and rejection sampling technique,the identity-based linkable ring signcryption scheme is constructed on the NTRU lattice.Firstly,the system master key is generated using the trapdoor generation algorithm on the NTRU lattice.Then private keys of ring members are obtained based on the compact Gaussian sampling algorithm.Finally,the user signature is generated using rejection sampling,and the key encapsulation mechanism encrypts the signature.Security proof in the random oracle model (ROM) that DRLWE and NTRU small integer solutions are difficult to solve ensures confidentiality,unforgeability,unconditional anonymity,and linkability.Performance analysis shows that compared to the lattice-based ring signcryption and linkable ring signature schemes on NTRU,the proposed scheme has a smaller public key and lower encryption/decryption cost,greatly improving efficiency.

•Sep 1, 2025•0 citations
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.
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.
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 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.
This paper, proposes a novel undeniable signature scheme based on the ring learning with errors (RLWE) problem, a complex lattice problem. In our scheme, authentic signatures can be validated via an interactive protocol, which guarantees that adversaries cannot forge signatures. Moreover, it ensures that honest participants consistently finish the verification procedure. Thus, the scheme is a strong and effective quantum-resistant undeniable signature scheme. Our security analysis, demonstrates resilience against both classical and quantum adversaries, based on the RLWE problem's hardness assumptions. Additionally, the random Oracle model is utilised to evaluate our protocol's security, showing that our scheme satisfies important cryptographic properties like completeness, soundness, and unforgeability. Our work advances the feasibility of post-quantum undeniable signature schemes for real-world cryptographic applications.
Although the current lattice-based ring signcryption scheme resists quantum attacks,it has large key storage and high encryption/decryption time.The linkable lattice ring signcryption scheme not only can protect signer anonymity,but also can determine whether two signatures are generated by the same signer.Thus,based on the compact Gaussian sampling algorithm and rejection sampling technique,the identity-based linkable ring signcryption scheme is constructed on the NTRU lattice.Firstly,the system master key is generated using the trapdoor generation algorithm on the NTRU lattice.Then private keys of ring members are obtained based on the compact Gaussian sampling algorithm.Finally,the user signature is generated using rejection sampling,and the key encapsulation mechanism encrypts the signature.Security proof in the random oracle model (ROM) that DRLWE and NTRU small integer solutions are difficult to solve ensures confidentiality,unforgeability,unconditional anonymity,and linkability.Performance analysis shows that compared to the lattice-based ring signcryption and linkable ring signature schemes on NTRU,the proposed scheme has a smaller public key and lower encryption/decryption cost,greatly improving efficiency.