A privacy-preserving efficient RFID authentication protocol from SLPN assumption

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.