Every step you take, I’ll be watching you: Practical StepAuth-entication of RFID paths
Path authentication thwarts counterfeits in RFID-based supply chains. Its motivation is that tagged products taking invalid paths are likely faked and injected by adversaries at certain supply chain partners/steps. Existing solutions are path-grained in that they simply regard a product as genuine i...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2018
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3859 https://ink.library.smu.edu.sg/context/sis_research/article/4861/viewcontent/08089353__1_.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-4861 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-48612019-02-04T04:33:58Z Every step you take, I’ll be watching you: Practical StepAuth-entication of RFID paths BU, Kai LI, Yingjiu Path authentication thwarts counterfeits in RFID-based supply chains. Its motivation is that tagged products taking invalid paths are likely faked and injected by adversaries at certain supply chain partners/steps. Existing solutions are path-grained in that they simply regard a product as genuine if it takes any valid path. Furthermore, they enforce distributed authentication by offloading the sets of valid paths to some or all steps from a centralized issuer. This not only imposes network and storage overhead but also leaks transaction privacy. We present StepAuth, the first step-grained path authentication protocol that is practically efficient for authenticating products with strict path bindings. We encode a path into a secret with minimum path visibility disclosure between adjacent steps. Carrying the secret, a product has to go through steps in the exact order as in the designated path to pass authentication. StepAuth enforces no tag computation and enables each step to locally verify path secrets without pre-offloaded valid-path sets. Toward an even higher security guarantee, StepAuth can hinder an adversary capable of compromising all steps from forging valid secrets. We make StepAuth practically efficient by taking advantage of nested encryption and hybrid encryption. To achieve a 128-bit security for a practically long path of 100 steps, StepAuth generates a secret around 10 KB, which can be well supported by high-memory EPC Gen2 tags. Such secrets take StepAuth less than 1 s to encode and around 10 ms to verify. 2018-04-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/3859 info:doi/10.1109/TIFS.2017.2768022 https://ink.library.smu.edu.sg/context/sis_research/article/4861/viewcontent/08089353__1_.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University RFID path authentication supply chain management Databases and Information Systems Information Security |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
RFID path authentication supply chain management Databases and Information Systems Information Security |
spellingShingle |
RFID path authentication supply chain management Databases and Information Systems Information Security BU, Kai LI, Yingjiu Every step you take, I’ll be watching you: Practical StepAuth-entication of RFID paths |
description |
Path authentication thwarts counterfeits in RFID-based supply chains. Its motivation is that tagged products taking invalid paths are likely faked and injected by adversaries at certain supply chain partners/steps. Existing solutions are path-grained in that they simply regard a product as genuine if it takes any valid path. Furthermore, they enforce distributed authentication by offloading the sets of valid paths to some or all steps from a centralized issuer. This not only imposes network and storage overhead but also leaks transaction privacy. We present StepAuth, the first step-grained path authentication protocol that is practically efficient for authenticating products with strict path bindings. We encode a path into a secret with minimum path visibility disclosure between adjacent steps. Carrying the secret, a product has to go through steps in the exact order as in the designated path to pass authentication. StepAuth enforces no tag computation and enables each step to locally verify path secrets without pre-offloaded valid-path sets. Toward an even higher security guarantee, StepAuth can hinder an adversary capable of compromising all steps from forging valid secrets. We make StepAuth practically efficient by taking advantage of nested encryption and hybrid encryption. To achieve a 128-bit security for a practically long path of 100 steps, StepAuth generates a secret around 10 KB, which can be well supported by high-memory EPC Gen2 tags. Such secrets take StepAuth less than 1 s to encode and around 10 ms to verify. |
format |
text |
author |
BU, Kai LI, Yingjiu |
author_facet |
BU, Kai LI, Yingjiu |
author_sort |
BU, Kai |
title |
Every step you take, I’ll be watching you: Practical StepAuth-entication of RFID paths |
title_short |
Every step you take, I’ll be watching you: Practical StepAuth-entication of RFID paths |
title_full |
Every step you take, I’ll be watching you: Practical StepAuth-entication of RFID paths |
title_fullStr |
Every step you take, I’ll be watching you: Practical StepAuth-entication of RFID paths |
title_full_unstemmed |
Every step you take, I’ll be watching you: Practical StepAuth-entication of RFID paths |
title_sort |
every step you take, i’ll be watching you: practical stepauth-entication of rfid paths |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2018 |
url |
https://ink.library.smu.edu.sg/sis_research/3859 https://ink.library.smu.edu.sg/context/sis_research/article/4861/viewcontent/08089353__1_.pdf |
_version_ |
1770573827900702720 |