Abstract
The use of RFID tags in personal items, such as passports, may make it possible to track a person's movements. Even RFID protocols that encrypt their identity may leak enough information to let an attacker trace a tag. In this paper we define strong and weak forms of untraceablility, and illustrate these definitions with a simple example. We formally define these concepts in the applied pi-calculus which in some cases makes it possible to automatically check if an RFID tag running a particular protocol is untraceable.
Original language | English |
---|---|
Title of host publication | Internet Technology and Secured Transactions, 2009. ICITST 2009. International Conference for |
Pages | 1-6 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 1 Nov 2009 |
Keywords / Materials (for Non-textual outputs)
- cryptography
- pi calculus
- radiofrequency identification
- telecommunication computing
- RFID tag
- encryption
- pi-calculus
- Computer science
- Control systems
- Cryptography
- Data security
- Databases
- Identity-based encryption
- Protocols
- RFID tags
- Radiofrequency identification
- Tracking