DocumentCode
2671742
Title
A Study on Secure RFID Mutual Authentication Scheme
Author
Li, Guorui ; Wang, Ying
Author_Institution
Electron. Inf. Dept., Northeastern Univ. at Qinhuangdao, Qinhuangdao, China
fYear
2010
fDate
18-20 Dec. 2010
Firstpage
706
Lastpage
710
Abstract
The primary defect of current authentication schemes for Radio Frequency Identification (RFID) tags lies in that in order to identify only one single tag they require a linear computational complexity on the server side. We propose a secure RFID mutual authentication scheme in this paper. It not only provides confidentiality, untraceability and mutual authentication, but also have efficiency in terms of time complexity, space complexity and communication cost which are very important for practical large scale RFID applications.
Keywords
computational complexity; message authentication; radiofrequency identification; linear computational complexity; radio frequency identification; secure RFID mutual authentication scheme; Authentication; Complexity theory; Privacy; Protocols; Radiofrequency identification; Servers; RFID; confidentiality; mutual authentication; security; untraceability;
fLanguage
English
Publisher
ieee
Conference_Titel
Green Computing and Communications (GreenCom), 2010 IEEE/ACM Int'l Conference on & Int'l Conference on Cyber, Physical and Social Computing (CPSCom)
Conference_Location
Hangzhou
Print_ISBN
978-1-4244-9779-9
Electronic_ISBN
978-0-7695-4331-4
Type
conf
DOI
10.1109/GreenCom-CPSCom.2010.37
Filename
5724907
Link To Document