A lattice-based signcryption scheme without random oracles

Lu, Xiuhua; Wen, Qiaoyan; Jin, Zilong; Wang, Licheng; Yang, Chunli

doi:10.1007/s11704-014-3163-1

Cited by 15 publications

(14 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2019, Yan et al [12] constructed an attribute-based signcryption scheme from a lattice in the standard model. Lu et al [13] in 2014 constructed a lattice-based signcryption scheme in the standard model. In [13], Lu et al used Boyen's SUF-ACMA secure signature [14] and broke the malleability of ciphertext by adopting the bimode encryption method.…”

Section: A Related Work and Discussionmentioning

confidence: 99%

“…Lu et al [13] in 2014 constructed a lattice-based signcryption scheme in the standard model. In [13], Lu et al used Boyen's SUF-ACMA secure signature [14] and broke the malleability of ciphertext by adopting the bimode encryption method. Xiang et al [15] designed an attribute-based signcryption scheme from a lattice in the ROM.…”

Section: A Related Work and Discussionmentioning

confidence: 99%

“…Xiang et al [15] designed an attribute-based signcryption scheme from a lattice in the ROM. Lu et al [16] constructed an IND-CPA secure signcryption scheme based on a signature without a trapdoor [17] and strengthened the scheme to IND-CCA2 secure signcryption in the ROM by employing Fujisaki-Okamoto's transformation technique [18]. Although the ROM simplifies the security proof, Leuren and Nguyen [19] showed that the ROM exists as a theoretical fault.…”

Section: A Related Work and Discussionmentioning

confidence: 99%

See 2 more Smart Citations

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: A Related Work and Discussionmentioning

confidence: 99%

Section: A Related Work and Discussionmentioning

confidence: 99%

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

show abstract

“…Regarding lattice-based signcryption constructions, there have been some works such as [13], [14], [15], [16] and [17]. Li et al [13] built a lattice-based signcryption scheme that are only secure in the random oracle model (ROM).…”

Section: Introductionmentioning

confidence: 99%

Lattice-based Signcryption with Equality Test in Standard Model

Lê

Duong

Roy

et al. 2020

Preprint

View full text Add to dashboard Cite

A signcryption, which is an integration of a public key encryption and a digital signature, can provide confidentiality and authenticity simultaneously. Additionally, a signcryption associated with equality test allows a third party (e.g., a cloud server) to check whether or not two ciphertexts are encrypted from the same message without knowing the message. This application plays an important role especially in computing on encrypted data. In this paper, we propose the first lattice-based signcryption scheme equipped with a solution to testing the message equality in the standard model. The proposed signcryption scheme is proven to be secure against insider attacks under the learning with errors assumption and the intractability of the short integer solution problem. As a by-product, we also show that some existing lattice-based signcryptions either is insecure or does not work correctly.

show abstract

“…The theory of ordered sets plays an important role in many mathematical fields, as algebra, analysis, graph theory, combinatorics (see for instance [10], [1], [28]), [23]), etc. It is applied in different areas as computer science, coding theory, cryptography, (see for instance [13], [6], [22]), etc., as well as being by itself a remarkable area of interest for researchers.…”

Section: Introductionmentioning

confidence: 99%