loading...
Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification
Buffalo, New York October 17-October 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AUTOID.2005.41Fourth IEEE Workshop on Automatic Ide ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Leonid Bolotnyy, Gabriel Robins, "Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification," Automatic Identification Advanced Technologies, IEEE Workshop on, pp. 43-48, Fourth IEEE Workshop on Automatic Identification Advanced Technologies (AutoID'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/AUTOID.2005.41,
author = {Leonid Bolotnyy and Gabriel Robins},
title = {Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification},
journal ={Automatic Identification Advanced Technologies, IEEE Workshop on},
volume = {0},
year = {2005},
isbn = {0-7695-2475-3},
pages = {43-48},
doi = {http://doi.ieeecomputersociety.org/10.1109/AUTOID.2005.41},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Automatic Identification Advanced Technologies, IEEE Workshop on
TI - Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification
SN - 0-7695-2475-3
SP43
EP48
A1 - Leonid Bolotnyy,
A1 - Gabriel Robins,
PY - 2005
KW - null
VL - 0
JA - Automatic Identification Advanced Technologies, IEEE Workshop on
ER -
 
Leonid Bolotnyy, University of Virginia
Gabriel Robins, University of Virginia
Privacy and security are two main concerns in Radio Frequency Identification (RFID) systems. We first extend the analysis of the Randomized Tree Walking Algorithm for RFID tag collision avoidance, which is secure against passive adversaries. Then, we devise a new Randomized Pseudo-Random Function (PRF) Tree Walking Algorithm, which is secure against active eavesdroppers and allows for the efficient interrogation of many tags. Our algorithm accommodates the addition and removal of tags from the system, and dynamically adapts to security and privacy policy changes.
Citation:
Leonid Bolotnyy, Gabriel Robins, "Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification," autoid, pp.43-48, Fourth IEEE Workshop on Automatic Identification Advanced Technologies (AutoID'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.