Citation
Abstract
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.
Download File
Full text not available from this repository.
Official URL or Download Paper: https://www.mdpi.com/2227-7390/11/5/1139
|
Additional Metadata
Item Type: | Article |
---|---|
Divisions: | Institute for Mathematical Research |
DOI Number: | https://doi.org/10.3390/math11051139 |
Publisher: | Multidisciplinary Digital Publishing Institute |
Keywords: | Public-key cryptography; Post-quantum cryptography; Code-based cryptography; Rank metric; Signature scheme; Identification scheme |
Depositing User: | Ms. Nur Faseha Mohd Kadim |
Date Deposited: | 28 Aug 2024 04:17 |
Last Modified: | 28 Aug 2024 04:17 |
Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.3390/math11051139 |
URI: | http://psasir.upm.edu.my/id/eprint/109109 |
Statistic Details: | View Download Statistic |
Actions (login required)
View Item |