A privacy-preserving efficient RFID authentication protocol from SLPN assumption
by Mohammad Saiful Islam Mamun; Atsuko Miyaji
International Journal of Computational Science and Engineering (IJCSE), Vol. 10, No. 3, 2015

Abstract: This paper presents an authentication protocol of an RFID system where both the tag and the reader are authenticated mutually. Optimal performance requirement, considering storage and computation constraints of low-cost tags, keeping security and privacy policies intact are some major challenges in recent research in this area. We propose a secure and private mutual authentication protocol of HB-family to meet the demand of low-cost tags. It is composed of subspace learning parity from noise (SLPN) problem and pseudo-inverse matrix properties where both of them significantly reduce the cost in terms of computation and hardware requirements. In addition, we compare our protocol with other existing HB-like and ordinary RFID authentication protocols according to their construction primitives and security and privacy achievements.

Online publication date: Wed, 15-Apr-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com