Randomized skip lists-based private authentication for large-scale RFID systems

Authors:
Kazuya Sakai;Min-Te Sun;Wei-Shinn Ku;Ten H. Lai
Affiliations:
The Ohio State University, Columbus, OH, USA;National Central University, Taoyuan, Taiwan Roc;Auburn University, Auburn, AL, USA;The Ohio State University, Columbus, OH, USA
Venue:
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Year:
2013

Citing 9
Cited 0

Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Privacy and security in library RFID: issues, practices, and architectures

Proceedings of the 11th ACM conference on Computer and communications security
A Secure and Efficient RFID Protocol that could make Big Brother (partially) Obsolete

PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
Dynamic Key-Updating: Privacy-Preserving Authentication for RFID Systems

PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
The optimal k-covering tag deployment for RFID-based localization

Journal of Network and Computer Applications
AnonPri: An efficient anonymous private authentication protocol

PERCOM '11 Proceedings of the 2011 IEEE International Conference on Pervasive Computing and Communications
Minimalist cryptography for low-cost RFID tags (extended abstract)

SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Dynamic Bit Encoding for Privacy Protection against Correlation Attacks in RFID Backward Channel

IEEE Transactions on Computers
An RFID and particle filter-based indoor spatial query evaluation system

Proceedings of the 16th International Conference on Extending Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The performance of key authentication and the degree of privacy in large-scale RFID systems are considered by many researchers as tradeoffs. Based on how keys are managed in the system, the privacy preserving tag authentications proposed in the past can be categorized into tree-based and group-based approaches. While a tree-based approach achieves high performance in key authentication, it suffers from the issue of low privacy should a fraction of tags be compromised. On the contrary, while group-based key authentication is relatively invulnerable to compromise attacks, it is not scalable to the large number of tags. In this paper, we propose a new private tag authentication protocol based on skip lists, named Randomized Skip Lists-based Authentication. Without sacrificing the authentication performance, our scheme provides a strong privacy preserving mechanism.