Lattice-Based Signcryption Without Random Oracles

Sato, Shingo; Shikata, Junji

doi:10.1007/978-3-319-79063-3_16

Cited by 13 publications

(40 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the design of lattice-based signcryption schemes in the standard model is an important target. Sato and Shikata [20] presented a lattice-based signcryption scheme without a random oracle. Gérard and Merckx [21] proposed a lattice-based signcryption scheme 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%

“…In this section, the performance of our scheme is analyzed from four aspects: the PK size, SK size, ciphertext overhead and concrete execution time. Meanwhile, we compare our scheme with other lattice-based schemes in [12], [20]- [23] to demonstrate that our scheme achieves better performance. The schemes in [26] and [27] are not anti-quantum signcryption schemes.…”

Section: Performance Analysis and Comparisonmentioning

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: ) Computational Overheadmentioning

confidence: 97%

Section: Performance Analysis and Comparisonmentioning

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

“…Zheng's sincryption scheme is based on the hardness of discrete logarithm problem. Since Zheng's work, a number of signcryption schemes based on different hard assumptions have been introduced, see for example [62], [63], [56], [58], [37], [7], [8], [28], [53], [59], [36], [61]. Of these, the most efficient ones have followed Zheng's approach, i.e., used symmetric-key encryption as a black-box component [7], [8], [28].…”

Section: Introductionmentioning

confidence: 99%

A code based hybrid signcryption scheme

Klamti¹,

Hasan²

2021

Preprint

View full text Add to dashboard Cite

A key encapsulation mechanism (KEM) that takes as input an arbitrary string, i.e., a tag, is known as tag-KEM, while a scheme that combines signature and encryption is called signcryption. In this paper, we present a code-based signcryption tag-KEM scheme. We utilize a code-based signature and a CCA2 (adaptive chosen ciphertext attack) secure version of McEliece's {encryption} scheme. The proposed scheme uses an equivalent subcode as a public code for the receiver, making the NP-completeness of the equivalent subcode problem be one of our main security assumptions. We then base the signcryption tag-KEM to design a code-based hybrid signcryption scheme. A hybrid scheme deploys an asymmetric- as well as a symmetric-key encryption. We give security analyses of both our schemes in the standard model and prove that they are secure against IND-CCA2 (indistinguishability under adaptive chosen ciphertext attack) and SUF-CMA (strong existential unforgeability under chosen message attack).

show abstract

“…At 2017, Li et al [7] proposed a signcryption for cloud computing. At PQCrypto' 18 [8] proposed lattice-based signcryption without random oracles. At the same time, Datta et al [9] proposed the functional signcryption.…”

Section: Introductionmentioning

confidence: 99%

On the RCCA Security of Hybrid Signcryption for Internet of Things

Dai

Wang

Chang

et al. 2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

With the rapid development of the Internet of Things (IoT), a lot of sensitive information in our daily lives are now digitalized and open to remote access. The provision of security and privacy of such data would incur comprehensive cryptographic services and has raised wide concern. Hybrid signcryption schemes could achieve various kinds of cryptographic services (e.g., confidentiality, authenticity, and integrity) with much lower cost than the combination of separate traditional cryptographic schemes with each providing a single cryptographic service. Thus, hybrid signcryption schemes are very suitable for IoT environments where resources are generally very constrained (e.g., lightweight sensors and mobile phones). To ensure that the overall hybrid signcryption scheme provides adequate cryptographic service (e.g., confidentiality, integrity, and authentication), its parts of KEM (key encryption mechanism) and DEM (data encryption mechanism) must satisfy some security requirements. Chosen-ciphertext attack (CCA) security has been widely accepted as the golden standard requirement for general encryption schemes. However, CCA security appears too strong in some conditions. Accordingly, Canetti et al. (CRYPTO 2003) proposed the notion of replayable CCA security (RCCA) for encryption schemes, which is a strictly weaker security notion than CCA security and naturally more efficient. This new security notion has proved to be sufficient for most existing applications of CCA security, e.g., encrypted password authentication. This is particularly promising for IoT environments, where security is demanding, yet resources are constrained. In this paper, we examine the RCCA security of the well-known SKEM+DEM style hybrid signcryption scheme by Dent at ISC 2005. Meanwhile, we also examine the RCCA security of the Tag-SKEM+DEM style hybrid signcryption scheme by Bjorstad and Dent at PKC 2006. We rigorously prove that a hybrid signcryption scheme can achieve RCCA security if both its SKEM part and its DEM part satisfy some security assumptions.

show abstract

Lattice-Based Signcryption Without Random Oracles

Cited by 13 publications

References 35 publications

Improved Lattice-Based Signcryption in the Standard Model

Improved Lattice-Based Signcryption in the Standard Model

A code based hybrid signcryption scheme

On the RCCA Security of Hybrid Signcryption for Internet of Things

Contact Info

Product

Resources

About