On The Performance Bound of Structured Key-Based RFID Authentication

摘要: Designing fast and secure RFID private authentication with structured key management is one of the most essential components for RFID-enabled large-scale object management. Since group keys are shared by some tags in key-based authentication, physical tampering tags, so called compromise attack, may enable adversary to obtain stored compromised which turn can be used distinguish other tags. All existing protocols try reduce common effect preserve high privacy. However, theoretical bound weak privacy achievable remains unknown. In this paper, we investigate authentication. To end, first formulate a mathematical model identifies probability two being linked respect number keys. Our shows that solutions far from ultimate goal Then, propose k-neighbor graph-based (KNGA) protocol, where random walk over graph performed. addition, show KNGA achieves performance bound, then quantify degree anonymity. Finally, extensive simulations demonstrate proposed protocol successfully its design goals.