|
Monday, March
26, 2007
Room 203
4:30 PM
Faculty
Host:
Kevin Fu and Benessa
Defend
Dependable RFID Systems
Abstract:
We discuss unlinkability and reliability in RFID applications.
First we consider hash-based schemes that can achieve unlinkability by
using low-cost hash
functions. Existing schemes are not scalable since the server needs O(N)
hash calculations for every ID matching, where N is the number of the
RFID devices. Our solution is the K-steps ID matching scheme, which can
reduce the number of the hash calculations on the server to O(log N).
Second, we propose an approach to increase the reliability of RFID that
relies on a
networked system instead of the performance of individual devices. There
are many factors that
reduce the accuracy of RFID tag identification, and which result in the
reduction of the total-system reliability. We show the effect
of our approach in the number of misidentifications,
the length of communication, and the number of RFID readers.
Third, we present a triage system using RFID.
Triage is a procedure used by emergency personnel to ration limited
medical resources to massively injured people. RFID triage tags, are
used to 1: classify and transport the injured effectively, and 2: obtain
and publish the state and the scale of the casualty incident. We applied
RFID tags and mobile devices in a wireLess network to increase the speed
and accuracy of the triage system.
We verified the effectiveness of our approach through an experiment,
which demonstrated that out system even accelerates the transportation
of the injured people.
  |