TY - JOUR
T1 - Rank AGS Identification Scheme and Signature Scheme
AU - Nagaraja, Vaishnavi
AU - Ariffin, Muhammad Rezal Kamel
AU - Lau, Terry Shue Chien
AU - Adenan, Nurul Nur Hanisah
AU - Chin, Ji Jian
AU - Yip, Sook Chin
AU - Yap, Timothy Tzen Vun
N1 - Funding Information:
The research was supported by the Ministry of Higher Education of Malaysia’s FRGS (FRGS/1/2019/ICT04/MMU/02/5) and the MMU Postdoc (MMUI/220141).
Funding Information:
This paper and the research behind it would not have been possible without the exceptional support from the Institute for Mathematical Research (INSPEM), Universiti Putra Malaysia (UPM) in allowing this research to be conducted. We also extend our endless gratitude to the MYBRAINSC scholarship scheme from the Ministry of Higher Education of Malaysia. Finally, the authors sincerely appreciate the editor and anonymous referees for their careful reading and helpful comments to improve this paper.
Publisher Copyright:
© 2023 by the authors.
PY - 2023/2/24
Y1 - 2023/2/24
N2 - 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.
AB - 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.
KW - code-based cryptography
KW - identification scheme
KW - post-quantum cryptography
KW - public-key cryptography
KW - rank metric
KW - signature scheme
UR - http://www.scopus.com/inward/record.url?scp=85149889449&partnerID=8YFLogxK
U2 - 10.3390/math11051139
DO - 10.3390/math11051139
M3 - Article
AN - SCOPUS:85149889449
SN - 2227-7390
VL - 11
JO - Mathematics
JF - Mathematics
IS - 5
M1 - 1139
ER -