ORCID
- Chin, Ji-Jian: 0000-0001-9809-6976
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.
DOI
10.3390/math11051139
Publication Date
2023-02-24
Publication Title
Mathematics
Volume
11
Issue
5
Embargo Period
2023-03-04
Organisational Unit
School of Engineering, Computing and Mathematics
Recommended Citation
Nagaraja, V., Ariffin, M., Lau, T., Adenan, N., Chin, J., Yip, S., & Yap, T. (2023) 'Rank AGS Identification Scheme and Signature Scheme', Mathematics, 11(5). Available at: https://doi.org/10.3390/math11051139
