Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
11-2016
Abstract
Logistical management has been advanced rapidly in these years, taking advantage of the broad connectivity of the Internet. As it becomes an important part of our lives, it also raises many challenging issues, e.g., the counterfeits of expensive goods pose a serious threat to supply chain management. As a result, path authentication becomes especially important in supply chain management, since it helps us maintain object pedigree and supply chain integrity. Meanwhile, tag path authentication must meet a series of security requirements, such as authentication, privacy, and unlinkability. In addition, the authentication protocol must be efficient.In 2011, the first tag path authentication protocol in an RFID-based supply chain, named “Tracker”, is proposed by Blass et al. in NDSS’11. They have made an important breakthrough in this research area. In this paper, we improve their work and propose a more efficient tag path authentication protocol in an RFID-based supply chain, which meets all the above mentioned security requirements. Our result shows that the proposed protocol can significantly reduce both computational overhead and memory requirement on tags, compared with the previous work.
Keywords
RFID, Tag path authentication, Security and privacy, Unlinkability
Discipline
Information Security
Research Areas
Cybersecurity
Publication
Proceedings of the 12th International Conference on Information Security Practice and Experience (ISPEC)
ISBN
978-3-319-49150-9
Identifier
10.1007/978-3-319-49151-6_18
Publisher
Springer
City or Country
Zhangjiajie, China
Citation
WANG, Hongbing; Yingjiu LI; ZHANG, Zongyang; and ZHAO, Yunlei.
Efficient Tag Path Authentication Protocol with Less Tag Memory. (2016). Proceedings of the 12th International Conference on Information Security Practice and Experience (ISPEC).
Available at: https://ink.library.smu.edu.sg/sis_research/3382
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://doi.org/10.1007/978-3-319-49151-6_18