Please use this identifier to cite or link to this item: http://hdl.handle.net/10497/21717
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZhang, Weien
dc.contributor.authorQin, Shimingen
dc.contributor.authorWang, Shengmingen
dc.contributor.authorWu, Longkaien
dc.contributor.authorYi, Baolinen
dc.date.accessioned2019-11-19T08:59:36Z-
dc.date.available2019-11-19T08:59:36Z-
dc.date.issued2018-
dc.identifier10.1007/s11277-018-5430-1-
dc.identifier.citationZhang, W., Qin, S., Wang, S., Wu, L., & Yi, B. (2018). A new scalable lightweight grouping proof protocol for RFID systems. Wireless Personal Communications, 103(1), 133-143. https://doi.org/10.1007/s11277-018-5430-1en
dc.identifier.issn0929-6212 (print)-
dc.identifier.issn1572-834X (online)-
dc.identifier.urihttp://hdl.handle.net/10497/21717-
dc.descriptionThis is the final draft, after peer-review, of a manuscript published in Wireless Personal Communications. The published version is available online at https://doi.org/10.1007/s11277-018-5430-1-
dc.description.abstractRadio-frequency Identification (RFID) grouping proof protocol is widely used in medical healthcare industry, trans-portation industry, crime forensics and so on,it is a research focus in the field of information security. The RFID grouping proof protocol is to prove that some tags belong to the same group and exist simultaneously. To improve the applicability of the RFID grouping proof protocol in low cost tag applications, this paper proposes a new scalable lightweight RFID grouping proof protocol. Tags in the proposed protocol only generate pseudorandom numbers and execute exclusive-or(XOR) opera-tions. An anti-collision algorithm based on adaptive 4-ary pruning query tree(A4PQT) is used to identify the response message of tags. Updates to secret information in tags are kept synchronized with the verifier during the entire grouping proof process. Based on these innovations, the proposed protocol resolves the scalability issue for low-cost tag systems and improves the efficiency and security of the authentication that is generated by the grouping proof. Compared with other state-of-the art pro-tocols, it is shows that the proposed protocol requires lower tag-side computational complexity, thereby achieving an effective balance between protocol security and efficiency.en
dc.language.isoenen
dc.subjectRFIDen
dc.subjectGrouping proofen
dc.subjectSecurityen
dc.subjectComputational costen
dc.subjectAuthenticationen
dc.titleA new scalable lightweight grouping proof protocol for RFID systemsen
dc.typePostprinten
Appears in Collections:Journal Articles
Files in This Item:
File Description SizeFormat 
WPC-103-1-133.pdf482.37 kBAdobe PDFThumbnail
View/Open
Show simple item record

Page view(s)

12
checked on Dec 7, 2019

Download(s)

2
checked on Dec 7, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.