Author
Listed:
- Vaishnavi Nagaraja
(Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia
These authors contributed equally to this work.)
- Muhammad Rezal Kamel Ariffin
(Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia
These authors contributed equally to this work.)
- Terry Shue Chien Lau
(Faculty of Computing and Informatics, Multimedia University, Cyberjaya 63100, Selangor, Malaysia
These authors contributed equally to this work.)
- Nurul Nur Hanisah Adenan
(Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia
These authors contributed equally to this work.)
- Ji-Jian Chin
(School of Engineering, Computing and Mathematics (Faculty of Science and Engineering), University of Plymouth, Drake Circus, Plymouth PL 48AA, UK
These authors contributed equally to this work.)
- Sook-Chin Yip
(Faculty of Engineering, Multimedia University, Cyberjaya 63100, Selangor, Malaysia
These authors contributed equally to this work.)
- Timothy Tzen Vun Yap
(Faculty of Computing and Informatics, Multimedia University, Cyberjaya 63100, Selangor, Malaysia
These authors contributed equally to this work.)
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.
Suggested Citation
Vaishnavi Nagaraja & Muhammad Rezal Kamel Ariffin & Terry Shue Chien Lau & Nurul Nur Hanisah Adenan & Ji-Jian Chin & Sook-Chin Yip & Timothy Tzen Vun Yap, 2023.
"Rank AGS Identification Scheme and Signature Scheme,"
Mathematics, MDPI, vol. 11(5), pages 1-17, February.
Handle:
RePEc:gam:jmathe:v:11:y:2023:i:5:p:1139-:d:1079836
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:5:p:1139-:d:1079836. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.