HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/6597
Title: ACTION : breaking the privacy barrier for RFID systems
Authors: Lu, Li
Han, Jinsong
Xiao, Renyi
Liu, Yunhao
Keywords: RFID
Privacy
Authentication
Compromising
Issue Date: Apr-2009
Citation: Proceedings IEEE INFOCOM 2009. The 28th Conference on Computer Communications, Rio de Janeiro, Brazil, 19-25 April 2009, p. 1953-1961.
Abstract: In order to protect privacy, Radio Frequency Identification (RFID) systems employ Privacy-Preserving Authentication (PPA) to allow valid readers to explicitly authenticate their dominated tags without leaking private information. Typically, an RF tag sends an encrypted message to the reader, then the reader searches for the key that can decrypt the cipher to identify the tag. Due to the large-scale deployment of today’s RFID systems, the key search scheme for any PPA requires a short response time. Previous designs construct balance-tree based key management structures to accelerate the search speed to O(logN), where N is the number of tags. Being efficient, such approaches are vulnerable to compromising attacks. By capturing a small number of tags, compromisingattackers are able to identify other tags that have not been corrupted. To address this issue, we propose an Anti-Compromising authenticaTION protocol, ACTION, which employs a novel sparse tree architecture, such that the key of every tag is independent from one another. The advantages of this design include: 1) resilience to the compromising attack, 2) reduction of key storage for tags from O(logN) to O(1), which is significant for resource critical tag devices, and 3) high search efficiency, which is O(logN), as good as the best in the previous designs.
Rights: © 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
URI: http://hdl.handle.net/1783.1/6597
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
action.pdf378KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.