Efficient Tag Path Authentication Protocol with Less Tag Memory
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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2016
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/3382 https://ink.library.smu.edu.sg/context/sis_research/article/4383/viewcontent/EfficientTagPathAuthenticationProtocolwithLessTagMemory.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| Summary: | 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. |
|---|