An Efficient Identification Scheme Based on Rank Metric

Ayebie, Edoukou Berenger; Assidi, Hafsa; Souidi, El Mamoun

doi:10.1007/978-3-030-45371-8_17

Cited by 4 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we recall the background on rank metrics and the hard problem used in this paper. We also introduce the specification for AGS and RankID that have been used in [7,11]. Throughout this paper, we will be using the following notations and definitions.…”

Section: Preliminariesmentioning

confidence: 99%

“…In this subsection, we first introduce the definitions and operations that have been used in RankID [11]. Then, we identified the errors found in the RankID scheme.…”

Section: Rankidmentioning

confidence: 99%

“…The RankID scheme [11] utilizes the double circulant matrix from the AGS ID scheme [7] to generate the generator matrix, G as a public key. The hard problem on which the RankID is based is the RSD problem.…”

Section: Rankidmentioning

confidence: 99%

“…Here, we provide more details regarding the errors that we encountered in the RankID (Table 3). The authors in [11] claimed that RankID achieved completeness by the following argument.…”

Section: Analysis Of Rankidmentioning

confidence: 99%

“…Nevertheless, Bellini et al [10] improved the rank Veron DSS and proposed another scheme, namely the RVDC identification protocol and DSS. Furthermore, in 2019, Ayebie et al [11] designed a rank metric version of the AGS identification scheme by using random double circulant codes, which is known as the RankID scheme.…”

Section: Introduction 1literature Reviewmentioning

confidence: 99%

See 4 more Smart Citations

Rank AGS Identification Scheme and Signature Scheme

et al. 2023

View full text Add to dashboard Cite

The identification protocol is a type of zero-knowledge proof. One party (the prover) needs to prove his identity to another party (the verifier) without revealing the secret key to the verifier. One can apply the Fiat–Shamir transformation to convert an identification scheme into a signature scheme which can be used for achieving security purposes and cryptographic purposes, especially for authentication. In this paper, we recall an identification protocol, namely the RankID scheme, and show that the scheme is incorrect and insecure. Then, we proposed a more natural approach to construct the rank version of the AGS identification protocol and show that our construction overcomes the security flaws in the RankID scheme. Our proposal achieves better results when comparing the public key size, secret key size, and signature size with the existing identification schemes, such as Rank RVDC and Rank CVE schemes. Our proposal also achieves 90%, 50%, and 96% reduction for the signature size, secret key size, and public key size when compared to the Rank CVE signature scheme.

show abstract

Section: Preliminariesmentioning

confidence: 99%

“…In this subsection, we first introduce the definitions and operations that have been used in RankID [11]. Then, we identified the errors found in the RankID scheme.…”

Section: Rankidmentioning

confidence: 99%

Section: Rankidmentioning

confidence: 99%

“…Here, we provide more details regarding the errors that we encountered in the RankID (Table 3). The authors in [11] claimed that RankID achieved completeness by the following argument.…”

Section: Analysis Of Rankidmentioning

confidence: 99%

Section: Introduction 1literature Reviewmentioning

confidence: 99%

See 3 more Smart Citations