A survey on RFID security and provably secure grouping-proof protocols
by Dang Nguyen Duc, Divyan M. Konidala, Hyunrok Lee, Kwangjo Kim
International Journal of Internet Technology and Secured Transactions (IJITST), Vol. 2, No. 3/4, 2010

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.

Online publication date: Mon, 06-Dec-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Technology and Secured Transactions (IJITST):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com