A digital signature scheme based on random error-correcting codes

Kabatianskii, Gregory; Krouk, Evgenii; Smeets, Ben

doi:10.1007/bfb0024461

Cited by 54 publications

(52 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The average is computed with 100 tests for p = 1 and 10 tests for p = 2. The values of t 1 and t 2 are taken from [KKS97] and [BMJ11]. The algorithm halts whenever it finds a word in the prescribed set.…”

Section: Resultsmentioning

confidence: 99%

“…This section is devoted to the description of two code-based signature schemes proposed in [KKS97] and more recently in [BMJ11], where the latter can be viewed as a "noisy" version of the former [KKS97]. Our presentation presents the main ideas without giving all the details which can be found in the original papers.…”

Section: The Kabatianskii-krouk-smeets Signature Scheme and Its Variantmentioning

confidence: 99%

“…Our presentation presents the main ideas without giving all the details which can be found in the original papers. We first focus on the scheme of [KKS97] whose construction relies on the following ingredients:…”

Section: The Kabatianskii-krouk-smeets Signature Scheme and Its Variantmentioning

confidence: 99%

“…A possible approach to meet this goal could be to build such schemes whose security relies on the difficulty of decoding linear codes. Two code based schemes of this kind have been proposed, namely the Courtois-Finiasz-Sendrier signature scheme [CFS01] and the Kabatianskii, Krouk and Smeets (KKS) scheme [KKS97,KKS05].…”

Section: Introductionmentioning

confidence: 99%

“…It was shown that a passive attacker who may intercept just a few signatures can recover the private key. All the schemes proposed in [KKS97] can be broken in this way with the help of at most 20 signatures. The security of the scheme is not compromised by this attack however if only one signature is computed, and this especially in the variant proposed in [BMJ11] where some random noise is added on top of the signature.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

An Efficient Attack on All Concrete KKS Proposals

Otmani¹,

Tillich²

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Kabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme based on a couple of random error-correcting codes. A variation of this scheme was proposed recently and was proved to be EUF-1CMA secure in the random oracle model. In this paper we investigate the security of these schemes and suggest a simple attack based on (essentially) Stern's algorithm for finding low weight codewords. It efficiently recovers the private key of all schemes of this type existing in the literature. This is basically due to the fact that we can define a code from the available public data with unusual properties: it has many codewords whose support is concentrated in a rather small subset. In such a case, Stern's algorithm performs much better and we provide a theoretical analysis substantiating this claim. Our analysis actually shows that the insecurity of the proposed parameters is related to the fact that the rates of the couple of random codes used in the scheme were chosen to be too close. This does not compromise the security of the whole KKS scheme. It just points out that the region of weak parameters is really much larger than previously thought.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: The Kabatianskii-krouk-smeets Signature Scheme and Its Variantmentioning

confidence: 99%

Section: The Kabatianskii-krouk-smeets Signature Scheme and Its Variantmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An Efficient Attack on All Concrete KKS Proposals

Otmani¹,

Tillich²

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

A new code‐based designated verifier signature scheme

Thanalakshmi

Anitha

2018

Int J Communication

View full text Add to dashboard Cite

Summary Designated verifier signature (DVS) scheme allows the verifier to verify the signature of a message but prevents from transferring the conviction to any third party. This scheme is useful in circumstances where authenticity, signer ambiguity, and signer's privacy are simultaneously needed in various applications such as electronic voting, call for tenders, etc. Most of the existing DVS schemes are based on the hard problems in number theory such as integer factorization or the discrete log problem. The construction of a large‐scale quantum computer would break those schemes. So, the National Institute of Standards and Technology Internal Report recommends to develop cryptographic systems that are secure against both the quantum and the classical computers. One such promising alternative to number theoretic cryptography is code‐based cryptography. This paper analyzes the code‐based strong designated verifier schemes proposed in 2016 by Ren et al and Koochak Shooshtari et al and shows that these schemes do not have non‐transferability which is the essential feature of a DVS scheme. Further, the paper proposed a DVS scheme built on syndrome decoding, a hard problem in coding theory, and proves its security properties such as unforgeability and non‐transferability in the random oracle model.

show abstract

Digital Signature Schemes from Codes

Gaborit

Sendrier

2011

Encyclopedia of Cryptography and Security

View full text Add to dashboard Cite

A digital signature scheme based on random error-correcting codes

Cited by 54 publications

References 9 publications

An Efficient Attack on All Concrete KKS Proposals

An Efficient Attack on All Concrete KKS Proposals

A new code‐based designated verifier signature scheme

Digital Signature Schemes from Codes

Contact Info

Product

Resources

About