Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
ALOHA packet system with and without slots and capture
ACM SIGCOMM Computer Communication Review
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
Adaptive splitting protocols for RFID tag collision arbitration
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Fast and reliable estimation schemes in RFID systems
Proceedings of the 12th annual international conference on Mobile computing and networking
Dynamic Key-Updating: Privacy-Preserving Authentication for RFID Systems
PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
Physically Unclonable Function-Based Security and Privacy in RFID Systems
PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
Refresh: weak privacy model for RFID systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient continuous scanning in RFID systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Anticollision Protocols for Single-Reader RFID Systems: Temporal Analysis and Optimization
IEEE Transactions on Mobile Computing
Identification-free batch authentication for RFID tags
ICNP '10 Proceedings of the The 18th IEEE International Conference on Network Protocols
Cardinality Estimation for Large-Scale RFID Systems
IEEE Transactions on Parallel and Distributed Systems
Interference cancellation-based RFID tags identification
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Tree algorithms for packet broadcast channels
IEEE Transactions on Information Theory
Every bit counts: fast and scalable RFID estimation
Proceedings of the 18th annual international conference on Mobile computing and networking
PET: Probabilistic Estimating Tree for Large-Scale RFID Estimation
IEEE Transactions on Mobile Computing
Generalized energy-efficient algorithms for the RFID estimation problem
IEEE/ACM Transactions on Networking (TON)
Fast identification of mobile RFID tags
MASS '12 Proceedings of the 2012 IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS)
| Hi-index | 0.00 |
Many algorithms have been introduced to deterministically authenticate Radio Frequency Identification (RFID) tags, while little work has been done to address the scalability issue in batch authentications. Deterministic approaches verify them one by one, and the communication overhead and time cost grow linearly with increasing size of tags. We design a fine-grained batch authentication scheme, INformative Counting (INC), which achieves sublinear authentication time and communication cost in batch verifications. INC also provides authentication results with accurate estimates of the number of counterfeiting tags and genuine tags, while previous batch authentication methods merely provide 0/1 results indicating the existence of counterfeits. We conduct detailed theoretical analysis and extensive experiments to examine this design and the results show that INC significantly outperforms previous work in terms of effectiveness and efficiency.