Space/time trade-offs in hash coding with allowable errors
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 Scalable and Provably Secure Hash-Based RFID Protocol
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Fast hash table lookup using extended bloom filter: an aid to network processing
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Quantitative evaluation of unlinkable ID matching schemes
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Severless Search and Authentication Protocols for RFID
PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
RIPP-FS: An RFID Identification, Privacy Preserving Protocol with Forward Secrecy.
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
An improved construction for counting bloom filters
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
RFID authentication protocol for low-cost tags
WiSec '08 Proceedings of the first ACM conference on Wireless network security
A Secure High-Speed Identification Scheme for RFID Using Bloom Filters
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
Providing Security and Privacy in RFID Systems Using Triggered Hash Chains
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
| Hi-index | 0.00 |
In this paper, we propose a secure identification scheme for RFID with efficient time and memory, and also an efficient update of pre-computed values on the server side. Although RFID ( Radio Frequency IDentification ) is becoming popular with pervasive computing environments, a privacy problem still remains, where an adversary can trace users' behavior by linking identification log by adversary readers. For this problem, a hash-chain scheme has been proposed as a secure identification for low-cost RFID tags, and its long identification time has been reduced by Avoine et al. using pre-computation on the server side. However, Avoine's scheme uses static pre-computation, and therefore pre-computed values include ones which are already used and no longer used. An efficient update of pre-computation is needed to remove these wasted values and this can reduce memory usage. In this paper, we optimize a lookup of pre-computed values using d-left hashing, which is a fast lookup technique, and provide efficient update of pre-computed values. We also show reasonable analytical evaluation and experimental result for memory and pre-computation/identification/update time.