Abstract
Randomized hash-lock protocols for Radio Frequency IDentification (RFID) tags offer forward untraceability, but incur heavy search on the server. Key trees have been proposed as a way to reduce search times, but because partial keys in such trees are shared, key compromise affects several tags. Buttyán et al. have defined measures for the resulting loss of anonymity in the system, and approximated their measures by means of simulations. We will further improve upon their trees, and provide a proof of optimality. Finally, an efficient recursive algorithm is presented to compute the anonymity measures.
| Original language | English |
|---|---|
| Title of host publication | Radio Frequency Identification: Security and Privacy Issues |
| Subtitle of host publication | 8th International Workshop, RFIDSec 2012, Nijmegen, The Netherlands, July 2-3, 2012, Revised Selected Papers |
| Place of Publication | Berlin, Heidelberg |
| Publisher | Springer |
| Pages | 31-47 |
| Number of pages | 17 |
| ISBN (Electronic) | 978-3-642-36140-1 |
| ISBN (Print) | 978-3-642-36139-5 |
| DOIs | |
| Publication status | Published - 2013 |
| Externally published | Yes |
| Event | 8th International Workshop on Radio Frequency Identification: Security and Privacy Issues, RFIDSec 2012 - Nijmegen, Netherlands Duration: 2 Jul 2012 → 3 Jul 2012 Conference number: 8 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 7739 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 8th International Workshop on Radio Frequency Identification: Security and Privacy Issues, RFIDSec 2012 |
|---|---|
| Abbreviated title | RFIDSec 2012 |
| Country/Territory | Netherlands |
| City | Nijmegen |
| Period | 2/07/12 → 3/07/12 |
Keywords
- Anonymity
- Anonymity set
- Authentication delay
- Hash-lock protocol
- Key-tree
- RFID
- n/a OA procedure