<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06080349</id>
  <dt>a</dt>
  <an>06080349</an>
  <augroup>
    <au>Cai, Shaoying</au>
    <au>Deng, Robert H.</au>
    <au>Li, Yingjiu</au>
    <au>Zhao, Yunlei</au>
  </augroup>
  <ti>A new framework for privacy of RFID path authentication.</ti>
  <so>Bao, Feng (ed.) et al., Applied cryptography and network security. 10th international conference, ACNS 2012, Singapore, June 26--29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31283-0/pbk). Lecture Notes in Computer Science 7341, 473-488 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-31284-7_28</li>
  </ligroup>
  <abgroup>
    <ab>Summary: RFID-based path authentication enables supply chain managers to verify the exact path that a tag has taken. In this paper, we introduce a new oracle Move that models a tag's movement along a designed or an arbitrary path in a supply chain. With this oracle, we refine the existing security and privacy notions for RFID-based path authentication. In addition, we propose a new privacy notion, called path privacy, for RFID-based path authentication. Our privacy notion captures the privacy of both tag identity and path information in a single game. Compared to existing two-game based privacy notions, it is more rigorous, powerful, and concise. We also construct a new path authentication scheme. Our scheme does not require the entities in a supply chain to have any connection with each other except in the initial stage. It requires only 480 bits storage and no computational ability on each tag; thus it can be deployed on the standard EPCglobal Class 1 Generation 2 tags in the market.</ab>
    <rv></rv>
  </abgroup>
</item>