Show simple item record

dc.contributor.authorNagaraja, V
dc.contributor.authorAriffin, MRK
dc.contributor.authorLau, TSC
dc.contributor.authorAdenan, NNH
dc.contributor.authorChin, Ji-Jian
dc.contributor.authorYip, S-C
dc.contributor.authorYap, TTV
dc.date.accessioned2023-03-03T10:28:41Z
dc.date.available2023-03-03T10:28:41Z
dc.date.issued2023-02-24
dc.identifier.issn2227-7390
dc.identifier.issn2227-7390
dc.identifier.other1139
dc.identifier.urihttp://hdl.handle.net/10026.1/20539
dc.description.abstract

<jats:p>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.</jats:p>

dc.format.extent1139-1139
dc.languageen
dc.language.isoen
dc.publisherMDPI AG
dc.subjectpublic-key cryptography
dc.subjectpost-quantum cryptography
dc.subjectcode-based cryptography
dc.subjectrank metric
dc.subjectsignature scheme
dc.subjectidentification scheme
dc.titleRank AGS Identification Scheme and Signature Scheme
dc.typejournal-article
dc.typeJournal Article
plymouth.author-urlhttps://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000948269700001&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=11bb513d99f797142bcfeffcc58ea008
plymouth.issue5
plymouth.volume11
plymouth.publication-statusPublished online
plymouth.journalMathematics
dc.identifier.doi10.3390/math11051139
plymouth.organisational-group/Plymouth
plymouth.organisational-group/Plymouth/Faculty of Science and Engineering
plymouth.organisational-group/Plymouth/Faculty of Science and Engineering/School of Engineering, Computing and Mathematics
plymouth.organisational-group/Plymouth/Users by role
plymouth.organisational-group/Plymouth/Users by role/Academics
dcterms.dateAccepted2023-01-30
dc.rights.embargodate2023-3-4
dc.identifier.eissn2227-7390
dc.rights.embargoperiodNot known
rioxxterms.versionofrecord10.3390/math11051139
rioxxterms.licenseref.urihttp://www.rioxx.net/licenses/all-rights-reserved
rioxxterms.typeJournal Article/Review


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record


All items in PEARL are protected by copyright law.
Author manuscripts deposited to comply with open access mandates are made available in accordance with publisher policies. Please cite only the published version using the details provided on the item record or document. In the absence of an open licence (e.g. Creative Commons), permissions for further reuse of content should be sought from the publisher or author.
Theme by 
Atmire NV