Abstract
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.
Highlights
The signcryption scheme proposed by Zheng provides message authentication, confidentiality, integrity and nonrepudiation of data simultaneously [1]
INDEX TERMS Signcryption, lattice, encapsulation, ring learning with errors (RLWE) problem, ideal short integer solution (ISIS) problem
In 2012, Li et al [6] constructed a lattice-based signcryption scheme with a random oracle model (ROM) based on the preimage sampling function and hash-based signature proposed by Peikert [7]
Summary
The signcryption scheme proposed by Zheng provides message authentication, confidentiality, integrity and nonrepudiation of data simultaneously [1]. In 2012, Li et al [6] constructed a lattice-based signcryption scheme with a random oracle model (ROM) based on the preimage sampling function and hash-based signature proposed by Peikert [7]. In 2013, Yan et al [10] constructed a lattice-based signcryption scheme that was proven to be secure in the standard model. In 2019, Yan et al [12] constructed an attribute-based signcryption scheme from a lattice in the standard model. Katsumata and Yamada [28] constructed a homomorphic computation function in 2016 and designed an adaptively secure identity-based encryption scheme from an ideal lattice. To achieve EUF-ACMA security, we use the confined guessing technique and the tag-based lattice trapdoor to design the signature section.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
