A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Filters
On Kabatianskii-Krouk-Smeets Signatures
[chapter]
Lecture Notes in Computer Science
Preserved Fulltext
Kabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme based on random error-correcting codes. In this paper we investigate the security and the efficiency of their proposal. ...
signatures. ...
Introduction Kabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme based on random error-correcting codes. ...
doi:10.1007/978-3-540-73074-3_18
fatcat:h6aqboj2t5faxnx3brbhatarbe
Page 5882 of Mathematical Reviews Vol. , Issue 99h
[page]
1999
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Bender (1-UCSD; La Jolla, CA)
99h:94047 94A60 94B05 Kabatianskii, G. [Kabatyanskii, G. A.] (RS-AOS-IT; Moscow); Krouk, E. [Kruk, E. A.] (RS-STPAI; St. Petersburg) ; Smeets, B. ...
Rueppel, “A new signature scheme based on the DSA giving message recovery”, in Proceedings of Ist ACM Conference on Computer and Communications Security, 1993; per bibl.] are proposed. ...
Page 5146 of Mathematical Reviews Vol. , Issue 99g
[page]
1999
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Deng, RSA-type signatures in the presence of transient faults (155-160); G. Kabatianskii [G. A. Kabatyan- skii], E. Krouk [E. A. Kruk] and B. ...
Smeets, A digital signature scheme based on random error-correcting codes (161-167); Vin- cent K. N. Lau and Malcolm D. ...
An Efficient Attack on All Concrete KKS Proposals
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Kabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme based on a couple of random error-correcting codes. ...
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. ...
Finally let F be the (N − K) × k matrix defined by F def = H J G T .The Kabatianskii-Krouk-Smeets (KKS) signature scheme is then described inFigure 1. ...
doi:10.1007/978-3-642-25405-5_7
fatcat:w4rf4z2yijacbma7ul6mfr4fp4
A Novel Digital Signature based on Error Correcting Codes
2019
International Journal on Recent and Innovation Trends in Computing and Communication
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The main goal is to make digital signature for which the security is based on decoding syndrome problem. ...
altered in transit (integrity).The idea of constructing practical signatures based on error correcting codes was introduced by Courtois et al in [1]. ...
So Kabatianskii, Krouk, and Smeets presented in [9] and [10] the KKS signature scheme based on arbitrary linear errorcorrecting codes. ...
doi:10.17762/ijritcc.v7i3.5253
fatcat:ux7q3fgul5fj5j5cyretjdz4ui
Recent Progress in Code-Based Cryptography
[chapter]
2011
Communications in Computer and Information Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
One of its most promising applications is the design of cryptographic schemes with exceptionally strong security guarantees and other desirable properties. ...
Section 3 deals with the new improvements of code-based signature schemes and Section 4 presents the new results in code-based secret-key cryptography. ...
The first one, by Kabatianskii, Krouk, and Smeets (KKS) [31] in 1997, is based on random codes and claimed to be secure. ...
doi:10.1007/978-3-642-23141-4_3
fatcat:tydg6d5zunhbplpchcnozoaanm
Improved Veron Identification and Signature Schemes in the Rank Metric
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
It is notably challenging to design an efficient and secure signature scheme based on error-correcting codes. ...
We reduced this probability to 1/2 to obtain the smallest signature among signature schemes based on the Fiat-Shamir paradigm, around 22 KBytes for 128 bit security level. ...
Kabatianskii, G., Krouk, E., Smeets, B.: A digital signature scheme based on random error-correcting codes. In: IMA International Conference on Cryptography and Coding. pp. 161-167 (1997) 27. ...
arXiv:1903.10212v2
fatcat:yd4ymcfcrjd6xcyu74nazco4sm
Post-quantum Cryptography: Code-Based Signatures
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we explicitly describe serveral code-based signature schemes with additional properties such as identity-based, threshold ring and blind signatures. ...
This survey provides a comparative overview of code-based signature schemes with respect to security and performance. ...
Kabatianskii et al.'s Scheme Kabatianskii, Krouk, and Smeets (KKS) [25] proposed a signature scheme based on arbitrary linear error-correcting codes. ...
doi:10.1007/978-3-642-13577-4_8
fatcat:vji7yr5skjfjpnoaisoc3pg27a
Post-Quantum Cryptography: Code-based Signatures
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we explicitly describe serveral code-based signature schemes with additional properties such as identity-based, threshold ring and blind signatures. ...
This survey provides a comparative overview of code-based signature schemes with respect to security and performance. ...
Kabatianskii et al.'s scheme Kabatianskii, Krouk, and Smeets (KKS) [24] proposed a signature scheme based on arbitrary linear errorcorrecting codes. ...
arXiv:1312.4265v1
fatcat:kdsuxv6scrfbthtsxqldf4z6ae
Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we address the problem of achieving efficient code-based digital signatures with small public keys. ...
Based on our evaluations, the proposed scheme is able to outperform existing solutions, permitting to achieve considerable security levels with very small public keys. ...
The two main proposals of code-based signature schemes currently available are the Courtois-Finiasz-Sendrier (CFS) scheme [13] and the Kabatianskii-Krouk-Smeets (KKS) scheme [18] . ...
arXiv:1305.5436v1
fatcat:3kvh2ylwavd23efws4zzanvfoe
Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment
2018
Cryptography
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper is the full version of a work appeared at SIN'18 as a short paper, which introduced a simple and efficient one-time secure signature scheme based on quasi-cyclic codes. ...
The design of a practical code-based signature scheme is an open problem in post-quantum cryptography. ...
Many schemes based on coding theory have been proposed over the years that either follow a "direct" hash-and-sign approach like the Courtois-Finiasz-Sendrier scheme (CFS) [2] and the Kabatianskii-Krouk-Smeets ...
doi:10.3390/cryptography2040030
fatcat:772qnnv74fhpfd5j3xq3ruulk4
The security of the code-based signature scheme based on the Stern identification protocol
[article]
2021
IACR Cryptology ePrint Archive
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The paper provides a complete description of the digital signature scheme based on the Stern identification protocol. ...
Finally, we discuss the choice of the signature parameters and introduce a parameter set providing 80-bit security. ...
Kabatianskii, E. Krouk and B. Smeets in the paper [10] in 1997. ...
dblp:journals/iacr/VysotskayaC21
fatcat:i5olu5yshrh6pa6pyhwzdeo4gy
An improved Durandal signature scheme
2020
Science China Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Our signature scheme takes less time to generate a signature owing to the fact that our signature scheme enjoys smaller security parameters in comparison to the Duradual scheme. ...
We compare the new scheme with existing code-based signature schemes and find that our signature scheme has advantages in terms of the public key size. ...
The KKS signature scheme [43] which Kabatianskii, Krouk, and Smeets put forward in 1997 has been considered to be a one-time signature scheme according to the attack given in [44] . ...
doi:10.1007/s11432-019-2670-7
fatcat:7y7y2wn2xzhmdaic43cz77ljxm
PolarSig: An efficient digital signature based on polar codes
2020
IET Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Most of the current code-based signature schemes are constructed based on Courtois, Finiasz, and Sendrier (CFS) signature. ...
Code-based digital signatures suffer from two main drawbacks: large public key size and slow signature generation. ...
The KKS (Kabatianskii, Krouk, and Smeets) [2] and CFS (Courtois, Finiasz, and Sendrier) [3] signature schemes are two main proposals of code-based signature schemes currently available. ...
doi:10.1049/iet-com.2019.0578
fatcat:xuouzim7dnbj7g7yxknnos7ob4
Modified pqsigRM: RM Code-based Signature Scheme
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Using a modified RM code, the proposed signature scheme resists various known attacks on RM-code-based cryptography. ...
This scheme is based on a modified Reed-Muller (RM) code, which reduces the signing complexity and key size compared with existing code-based signature schemes. ...
The Kabatianskii-Krouk-Smeets (KKS) signature scheme [30] and its variants [31] , [32] take a different approach than CFS signature scheme. ...
doi:10.1109/access.2020.3026989
fatcat:ozlmqazvojeznh5zh3mwcny2aq
« Previous
Showing results 1 — 15 out of 16 results