Document Type

Conference Proceeding

Language

eng

Format of Original

9 p.

Publication Date

3-2011

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Source Publication

2011 IEEE International Conference on Pervasive Computing and Communications (PerCom)

Source ISSN

9781612849386

Original Item ID

doi: 10.1109/PERCOM.2011.5767573

Abstract

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.

Comments

Accepted version. Published as part of the proceedings of the 2011 IEEE International Conference on Pervasive Computing and Communication (PerCom), 2011: 102-110. DOI. © 2011 IEEE. Used with permission.

Download
ahamed_1798acc.docx (183 kB)
ADA accessible version

Share

COinS