Rank AGS Identification Scheme and Signature Scheme

Vaishnavi Nagaraja, Muhammad Rezal Kamel Ariffin (), Terry Shue Chien Lau, Nurul Nur Hanisah Adenan, Ji-Jian Chin, Sook-Chin Yip and Timothy Tzen Vun Yap
Additional contact information
Vaishnavi Nagaraja: Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia
Muhammad Rezal Kamel Ariffin: Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia
Terry Shue Chien Lau: Faculty of Computing and Informatics, Multimedia University, Cyberjaya 63100, Selangor, Malaysia
Nurul Nur Hanisah Adenan: Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia
Ji-Jian Chin: School of Engineering, Computing and Mathematics (Faculty of Science and Engineering), University of Plymouth, Drake Circus, Plymouth PL 48AA, UK
Sook-Chin Yip: Faculty of Engineering, Multimedia University, Cyberjaya 63100, Selangor, Malaysia
Timothy Tzen Vun Yap: Faculty of Computing and Informatics, Multimedia University, Cyberjaya 63100, Selangor, Malaysia

Mathematics, 2023, vol. 11, issue 5, 1-17

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.

Keywords: public-key cryptography; post-quantum cryptography; code-based cryptography; rank metric; signature scheme; identification scheme (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/5/1139/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/5/1139/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:5:p:1139-:d:1079836

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().