Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Private and Secure Tag Access for Large-Scale RFID Systems
Department of Computer Science and Information Engineering, National Central University, Taoyuan 320, Taiwan.
Department of Information and Communication Systems, Tokyo Metropolitan University, 6-6 Asahigaoka, Hino, Tokyo.
Department of Computer Science and Software Engineering, Auburn University, Auburn,.
Department of Computer Science and Engineering, The Ohio State University, Columbus, OH 43210.
Show others and affiliations
Number of Authors: 5
2016 (English)In: IEEE Transactions on Dependable and Secure Computing, ISSN 1545-5971, E-ISSN 1941-0018, Vol. 13, no 6, 657-671 p.Article in journal (Refereed) Published
Abstract [en]

The performance of key authentication and the degree of privacy in large-scale RFID systems are considered by manyresearchers as tradeoffs. Based on how keys are managed in the system, the privacy preserving tag authentications proposed in thepast can be categorized into tree-based and group-based approaches. While a tree-based approach achieves high performance in keyauthentication, it suffers from the issue of low privacy should a fraction of tags be compromised. On the contrary, while group-based keyauthentication is relatively invulnerable to compromise attacks, it is not scalable to a large number of tags. In this paper, we propose anew private tag authentication protocol based on skip lists, named randomized skip lists-based authentication (RSLA). Withoutsacrificing the authentication performance, RSLA provides a high privacy preserving mechanism. While RSLA provides the same levelof unpredictability-based-privacy and indistinguishability-based privacy compared with other structured key management approaches,our scheme achieves the highest system anonymity with good performance in key look up and update. In addition, the simulationresults match our analyses closely.

Place, publisher, year, edition, pages
2016. Vol. 13, no 6, 657-671 p.
National Category
Media and Communication Technology
Research subject
Mobile and Pervasive Computing
Identifiers
URN: urn:nbn:se:ltu:diva-60519DOI: 10.1109/TDSC.2015.2427833ISI: 000388675900005Scopus ID: 2-s2.0-84990985774OAI: oai:DiVA.org:ltu-60519DiVA: diva2:1047421
Note

Validerad; 2016; Nivå 2; 2016-11-17 (inah)

Available from: 2016-11-17 Created: 2016-11-17 Last updated: 2017-11-29Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Vasilakos, Athanasios
By organisation
Computer Science
In the same journal
IEEE Transactions on Dependable and Secure Computing
Media and Communication Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 1 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf