DocumentCode
1921739
Title
An LPN-Problem-Based Lightweight Authentication Protocol for Wireless Communications
Author
Chang, Ya-Fen ; Lai, Yen-Cheng
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Nat. Taichung Inst. of Technol., Taichung
fYear
2009
fDate
16-19 March 2009
Firstpage
130
Lastpage
134
Abstract
Radio frequency identification (RFID) is a popular technology, but some problems still need to be overcome. Hopper and Blum proposed a light-weight authentication protocol, HB protocol, which is especially suitable for devices with low computation ability such as passive RFID tags. Later, HB protocol was proven to be insecure, and Munilla and Peinado amended it by proposing HB-MP and HB-MP protocols. However, only the tag is authenticated by the reader in these protocols. In this paper, we will present an enhancement of the HB-protocol family with mutual authentication to have only the legal reader obtain the legal reader´s data. The proposed protocol is light-weight because only scalar dot product operation of binary vectors and XOR operation are adopted. Moreover, it is computational secure since its security is based on solving LPN problem, an NP-complete problem.
Keywords
computational complexity; optimisation; protocols; radiofrequency identification; HB-protocol family; NP-complete problem; lightweight authentication protocol; mutual authentication; radio frequency identification; wireless communications; Authentication; Cryptographic protocols; Information security; Law; Legal factors; NP-complete problem; Radiofrequency identification; Resists; Wireless application protocol; Wireless communication; LPN problem; NP-complete problem; RFID; mutual authentication; wireless communications;
fLanguage
English
Publisher
ieee
Conference_Titel
Availability, Reliability and Security, 2009. ARES '09. International Conference on
Conference_Location
Fukuoka
Print_ISBN
978-1-4244-3572-2
Electronic_ISBN
978-0-7695-3564-7
Type
conf
DOI
10.1109/ARES.2009.33
Filename
5066464
Link To Document