A code-based signature scheme from the Lyubashevsky framework

Song, Yongsoo; Huang, Xinyi; Mu, Yi; Wu, Wei; Wang, Huaxiong

doi:10.1016/j.tcs.2020.05.011

Cited by 18 publications

(12 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [206] the authors propose a code-based signature scheme from the Lyubashevsky framework, which was then broken in [14].…”

Section: Codementioning

confidence: 99%

A Survey on Code-Based Cryptography

Weger¹,

Gassner²,

Rosenthal³

2022

Preprint

View full text Add to dashboard Cite

The improvements on quantum technology are threatening our daily cybersecurity, as a capable quantum computer can break all currently employed asymmetric cryptosystems. In preparation for the quantum-era the National Institute of Standards and Technology (NIST) has initiated a standardization process for public-key encryption (PKE) schemes, key-encapsulation mechanisms (KEM) and digital signature schemes. With this chapter we aim at providing a survey on code-based cryptography, focusing on PKEs and signature schemes. We cover the main frameworks introduced in code-based cryptography and analyze their security assumptions. We provide the mathematical background in a lecture notes style, with the intention of reaching a wider audience.

show abstract

“…In [206] the authors propose a code-based signature scheme from the Lyubashevsky framework, which was then broken in [14].…”

Section: Codementioning

confidence: 99%

A Survey on Code-Based Cryptography

Weger¹,

Gassner²,

Rosenthal³

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Recently, [18][19][20] used the Schnorr-Lyubashevsky framework to construct code based signatures without trapdoors. The Schnorr-Lyubashevsky framework has been shown able to produce secure and efficient signature schemes without trapdoors in the lattice-based setting.…”

Section: Related Workmentioning

confidence: 99%

Code-based Sequential Aggregate Signature Scheme

Dou¹,

Xu²,

Yu³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

This paper proposes the first code-based quantum immune sequential aggregate signature (SAS) scheme and proves the security of the proposed scheme in the random oracle model. Aggregate signature (AS) schemes and sequential aggregate signature schemes allow a group of potential signers to sign different messages respectively, and all the signatures of those users on those messages can be aggregated into a single signature such that the size of the aggregate signature is much smaller than the total size of all individual signatures. Because of the aggregation of many signatures into a single short signature, AS and SAS schemes can reduce bandwidth and save storage; moreover, when a SAS is verified, not only the valid but also the order in which each signer signed can be verified. AS and SAS schemes can be applied to traffic control, banking transaction and military applications. Most of the existing AS and SAS schemes are based either on pairing or Rivest-Shamir-Adleman (RSA), and hence, can be broken by Shor's quantum algorithm for Integer Factoring Problem (IFP) and Discrete Logarithm Problem (DLP). There are no quantum algorithms to solve syndrome decoding problems. Hence, code-based cryptography is seen as one of the promising candidates for post-quantum cryptography. This paper shows how to construct quantum immune sequential aggregate signatures based on coding theory. Specifically, we construct our scheme with the first code based signature scheme proposed by Courtois, Finiasz and Sendrier (CFS). Compared to the CFS signature scheme without aggregation, the proposed sequential aggregate signature scheme can save about 90% storage when the number of signers is asymptotically large.

show abstract

“…To address this issue, Lyubashevsky's framework [38] can apparently be adapted. Unfortunately almost all code-based signature schemes in Hamming metric designed by using this framework have been cryptanalyzed [15], [49], [50], [32], [39], [55]. The only one which has remained secure so far is a rank metric-based signature scheme proposed by Aragon et al [1].…”

Section: Code-based Signaturementioning

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

A code-based signature scheme from the Lyubashevsky framework

Cited by 18 publications

References 11 publications

A Survey on Code-Based Cryptography

A Survey on Code-Based Cryptography

Code-based Sequential Aggregate Signature Scheme

A code based hybrid signcryption scheme

Contact Info

Product

Resources

About