A Signcryption Scheme Based Learning with Errors over Rings Without Trapdoor

Liu, Zhen; Han, Yiliang; Yang, Xiaoyuan

doi:10.1007/978-981-15-0105-0_11

Cited by 3 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Gérard and Merckx [21] proposed a lattice-based signcryption scheme in the ROM. Liu et al [22] constructed a new lattice-based signcryption scheme in the ROM by combining an RLWE-based signature scheme and an RLWE-based key exchange scheme. Zhang et al [23] presented a multi-receiver identitybased signcryption scheme from a lattice in the ROM.…”

Section: A Related Work and Discussionmentioning

confidence: 99%

“…1, to simplify the analysis, we set q = 277063. We compare our scheme with YWL [12], SS [20], GM [21], LHY [22] and ZXX [23] in terms of the communication overhead when choosing different dimensions n. According to Fig. 1, the communication costs of our signcryption schemes are lower than those of other lattice-based signcryption schemes.…”

Section: ) Computational Overheadmentioning

confidence: 97%

See 1 more Smart Citation

Improved Lattice-Based Signcryption in the Standard Model

Yang¹,

Cao

Li³

et al. 2019

IEEE Access

View full text Add to dashboard Cite

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. INDEX TERMS Signcryption, lattice, encapsulation, ring learning with errors (RLWE) problem, ideal short integer solution (ISIS) problem.

show abstract

Section: A Related Work and Discussionmentioning

confidence: 99%

Section: ) Computational Overheadmentioning

confidence: 97%

Improved Lattice-Based Signcryption in the Standard Model

Yang¹,

Cao

Li³

et al. 2019

IEEE Access

View full text Add to dashboard Cite

show abstract

Post-quantum blind signcryption scheme from lattice

Bai

2021

Front Inform Technol Electron Eng

View full text Add to dashboard Cite

Practical NTRU Signcryption in the Standard Model

Yan,

Lu,

et al. 2023

Entropy

View full text Add to dashboard Cite

Based on the NTRU trapdoor used in NIST’s Falcon, a signcryption scheme following the sign-then-encrypt paradigm is constructed. The existing partitioning technique based on Waters hash over the lattice can not complete the security reduction in the standard model for the signature part due to the “partiality” of the pre-image generated with the NTRU trapdoor. To address this, a variant of Waters hash over small integers is proposed and, the probability of the successful reduction is analyzed. The resulting signcryption achieves existential unforgeability under the adaptive chosen-message attacks. By utilizing the uniqueness of the secret and the noise in an NTRU instance, the tag used in encryption is eliminated. Furthermore, a method to construct tamper-sensitive lattice public key encryption is proposed. This approach implants the ciphertext-sensitive information into the lattice public key encryption and binds it to the encrypted information. The malleability to the public key ciphertext triggers the change of the message–signature pair so that the IND-CCA2 security of the entire ciphertext can be guaranteed by the signature for the message. Thanks to the rational design and the efficiency of the NTRU trapdoor, the computational overhead of the proposed scheme is reduced significantly compared to the existing lattice-based signcryption scheme, reaching orders of magnitude improvement in efficiency. The experiment shows that the proposed scheme is efficient.

show abstract

A Signcryption Scheme Based Learning with Errors over Rings Without Trapdoor

Cited by 3 publications

References 14 publications

Improved Lattice-Based Signcryption in the Standard Model

Improved Lattice-Based Signcryption in the Standard Model

Post-quantum blind signcryption scheme from lattice

Practical NTRU Signcryption in the Standard Model

Contact Info

Product

Resources

About