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
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
A distributed architecture for scalable private RFID tag identification
Computer Networks: The International Journal of Computer and Telecommunications Networking
Private and Secure Service Discovery via Progressive and Probabilistic Exposure
IEEE Transactions on Parallel and Distributed Systems
Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Defining strong privacy for RFID
ACM Transactions on Information and System Security (TISSEC)
A secure and scalable identification for hash-based RFID systems using updatable pre-computation
Proceedings of the third ACM conference on Wireless network security
Performance analysis of the simple lightweight authentication protocol
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Quantifying information leakage in tree-based hash protocols (short paper)
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Optimal key-trees for tree-based private authentication
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Modeling privacy for off-line RFID systems
CARDIS'10 Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Application
Simple Lightweight Authentication Protocol: Security and Performance Considerations
International Journal of Business Data Communications and Networking
| Hi-index | 0.00 |
As pervasive computing environments become popular, RFID devices, such as contactless smart cards and RFID tags, are introduced into our daily life. However, there exists a privacy problem that a third party can trace user's behavior by linking device's ID.The concept of unlinkability, that a third party cannot recognize whether some outputs are from the same user, is important to solve the privacy problem. A scheme using hash function satisfies unlinkability against a third party by changing the outputs of RFID devices every time. However, the schemes are not scalable since the server needs O(N) hash calculations for every ID matching, where N is the number of RFID devices.In this paper, we propose the K-steps ID matching scheme, which can reduce the number of the hash calculations on the server to O(log N). Secondly, we propose a quantification of unlinkability using conditional entropy and mutual information. Finally, we analyze the K-steps ID matching scheme using the proposed quantification, and show the relation between the time complexity and unlinkability.