Title: A survey on RFID security and provably secure grouping-proof protocols

Authors: Dang Nguyen Duc, Divyan M. Konidala, Hyunrok Lee, Kwangjo Kim

Addresses: Department of Computer Science, KAIST 119 Munjiro, Yuseong-gu, Daejeon 305-732, Republic of Korea. ' Department of Information and Communications Engineering, KAIST 119 Munjiro, Yuseong-gu, Daejeon 305-732, Republic of Korea. ' Department of Computer Science, KAIST 119 Munjiro, Yuseong-gu, Daejeon 305-732, Republic of Korea. ' Department of Computer Science, KAIST 119 Munjiro, Yuseong-gu, Daejeon 305-732, Republic of Korea

Abstract: RFID security is a relatively new research area. Within less than a decade, a large number of research papers dealing with security issues of RFID technology have appeared. In the first part of this paper, we attempt to summarise current research in the field of RFID security and discuss some of their open issues. In the second part of this paper, we address some of the open problems we suggested in the first part. In particular, we deal with scalability problem of existing grouping-proof protocols for RFID tags. In addition, we also present the first security definition for a secure grouping-proof protocol for RFID tags. The definition is then used to analyse the security of our proposed grouping-proof protocol which employs a (n, n)-secret sharing scheme to solve the scalability problem of previous protocols.

Keywords: RFID security; tag cloning; tag privacy; authentication; grouping-proof; scalability; security models; security definition; provable security; radio frequency identification; RFID tags.

DOI: 10.1504/IJITST.2010.037403

International Journal of Internet Technology and Secured Transactions, 2010 Vol.2 No.3/4, pp.222 - 249

Available online: 06 Dec 2010

Full-text access for editors Access for subscribers Purchase this article Comment on this article