TY - GEN
T1 - AnonPri
T2 - 9th IEEE International Conference on Pervasive Computing and Communications, PerCom 2011
AU - Hoque, Md Endadul
AU - Rahman, Farzana
AU - Ahamed, Sheikh Iqbal
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2011
Y1 - 2011
N2 - Privacy protection is a very important issue during authentications in RFID systems. In order to achieve high-speed authentication in large-scale RFID systems, researchers propose tree-based approaches, in which any pair of tags share a number of key components. Another technique can be to perform group based private authentication that improves the tradeoff between scalability and privacy by dividing the tags into a number of groups. This is a novel authentication scheme that ensures privacy of the provers. However, one limitation of this technique is that the level of privacy provided by the scheme decreases as more and more tags are compromised Therefore, in this paper, we propose a group based anonymous private authentication protocol (AnonPri) that provides higher level of privacy than the above mention group based scheme and achieves better efficiency than the approaches that prompt the reader to perform an exhaustive search. Our protocol provides unlinkability and thereby preserves privacy. The adversary cannot link the responses with the tags, even if she can learn the identifier that the tags are using to produce the response. To evaluate AnonPri, we have compared both the protocols, AnonPri and the group based authentication. The experiment results establish that the level of privacy provided by AnonPri is higher than that of the group based authentication.
AB - Privacy protection is a very important issue during authentications in RFID systems. In order to achieve high-speed authentication in large-scale RFID systems, researchers propose tree-based approaches, in which any pair of tags share a number of key components. Another technique can be to perform group based private authentication that improves the tradeoff between scalability and privacy by dividing the tags into a number of groups. This is a novel authentication scheme that ensures privacy of the provers. However, one limitation of this technique is that the level of privacy provided by the scheme decreases as more and more tags are compromised Therefore, in this paper, we propose a group based anonymous private authentication protocol (AnonPri) that provides higher level of privacy than the above mention group based scheme and achieves better efficiency than the approaches that prompt the reader to perform an exhaustive search. Our protocol provides unlinkability and thereby preserves privacy. The adversary cannot link the responses with the tags, even if she can learn the identifier that the tags are using to produce the response. To evaluate AnonPri, we have compared both the protocols, AnonPri and the group based authentication. The experiment results establish that the level of privacy provided by AnonPri is higher than that of the group based authentication.
KW - RFID
KW - anonymous
KW - authentication
KW - privacy
KW - security
UR - http://www.scopus.com/inward/record.url?scp=79957965485&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79957965485&partnerID=8YFLogxK
U2 - 10.1109/PERCOM.2011.5767573
DO - 10.1109/PERCOM.2011.5767573
M3 - Conference contribution
AN - SCOPUS:79957965485
SN - 9781424495290
T3 - 2011 IEEE International Conference on Pervasive Computing and Communications, PerCom 2011
SP - 102
EP - 110
BT - 2011 IEEE International Conference on Pervasive Computing and Communications, PerCom 2011
Y2 - 21 March 2011 through 25 March 2011
ER -