Tree-LSHB+: An LPN-Based Lightweight Mutual Authentication RFID Protocol
- PDF / 771,361 Bytes
- 16 Pages / 439.37 x 666.142 pts Page_size
- 56 Downloads / 218 Views
Tree-LSHB+: An LPN-Based Lightweight Mutual Authentication RFID Protocol Guanyang Deng · Hui Li · Ying Zhang · Jun Wang
Published online: 24 January 2013 © Springer Science+Business Media New York 2013
Abstract In this paper, we propose an enhancement of the Tree-based authentication protocol, named as the Tree-LSHB+ protocol. The protocol is a lightweight authentication protocol that is suitable for use in radio frequency identification (RFID) systems. Compared with the Tree-based HB authentication protocol, our protocol provides mutual authentication in authentication stage. The authentication keys stored in the reader and the tag are also updated when the mutual authentication succeeds. It means that two drawbacks can be avoided in the Tree-based authentication protocol, one is that only the reader authenticates the tag and the other is that the secret keys stored in the tags remain unchanged all the time. We also improve the performance of Tree-based protocol with the property of Toeplitz matrix and find that the Tree-LSHB+ protocol is still a good choice for RFID authentication. Keywords
RFID · Security · LPN · Tree-based · Mutual authentication
1 Introduction Radio frequency identification (RFID) is a technology used for automatic identification of objects and people as a ubiquitous infrastructure. An RFID system consists of three main components: a reader, several tags, and a backend database. The reader and the tags communicate with a radio frequency link, while the reader is connected to the backend database through a secure wired link. It is necessary to authenticate between the reader and the tags to guarantee security and protect the user’s privacy in the wireless environment. However, in order to be widely used, the tags should be low-cost, so the computing power and resource of RFID tags is expected to remain extremely limited. Hence the traditional cryptographic algorithms are hard to be applied and there is a pressing need for lightweight protocols.
G. Deng (B) · H. Li · Y. Zhang · J. Wang School of Computer Science, Beijing University of Posts and Telecommunications, No.10, Xitucheng Road, Beijing, People’s Republic of China e-mail: [email protected]
123
160
G. Deng et al.
Many lightweight authentication protocols have been proposed so far. In 2000, Hopper and Blum [1] proposed an authentication protocol, which is known as the HB protocol. The HB protocol relies on the computation hardness of the Learning Parity with Noise (LPN) problem, and requires only the implementation of dot products of binary vectors and a random noise bit, so it is very lightweight and suitable for devices with low computation ability such as RFID tags. In 2005, Juels and Weis [2] proved that HB protocol could only resist passive attacks and introduced a modification of protocol, HB+ protocol, to resist active attacks. Later, Katz and Shin [3] and Gilbert et al. [4] proved the parallel concurrent security property of the HB and HB+ protocols. Gilbert also showed that both of the two protocols are vulnerable to a man
Data Loading...
