Rank AGS Identification Scheme and Signature Scheme


Nagaraja, Vaishnavi and Kamel Ariffin, Muhammad Rezal and Lau, Terry Shue Chien and Adenan, Nurul Nur Hanisah and Chin, Ji Jian and Yip, Sook Chin and Yap, Timothy Tzen Vun (2023) Rank AGS Identification Scheme and Signature Scheme. Mathematics, 11 (5). p. 1139. ISSN 2227-7390

[img] Text
mathematics-11-01139-v2.pdf - Published Version
Restricted to Repository staff only

Download (840kB)


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.

Item Type: Article
Uncontrolled Keywords: public-key cryptography; post-quantum cryptography; code-based cryptography; rank metric; signature scheme; identification scheme
Subjects: Q Science > QA Mathematics > QA273-280 Probabilities. Mathematical statistics
Divisions: Faculty of Computing and Informatics (FCI)
Depositing User: Ms Nurul Iqtiani Ahmad
Date Deposited: 11 Apr 2023 02:10
Last Modified: 11 Apr 2023 02:10
URII: http://shdl.mmu.edu.my/id/eprint/11330


Downloads per month over past year

View ItemEdit (login required)