Three types of RFID tags Passive / Active / Semi-Active up to 19m range for UHF

Three types of RFID tags • Passive / Active / Semi-Active • up to 19m range for UHF Computer Computer Science Science Department Department of of University of University of Virginia Virginia Generalized “Yoking- Generalized “Yoking- Proofs” Proofs” for a Group of RFID for a Group of RFID Tags Tags RFID Tag “Yoking-Proofs” RFID Tag “Yoking-Proofs” Generalized Tag Group “Yoking-Proof” Generalized Tag Group “Yoking-Proof” Algorithmic Speedups Algorithmic Speedups Group Yoking Protocol Group Yoking Protocol [email protected], [email protected] School of Engineering & Applied School of Engineering & Applied Science Science www.cs.virginia.edu/ robins Leonid Bolotnyy and Gabriel Robins Leonid Bolotnyy and Gabriel Robins Timer on-board a tag FCC regulations: protocol termination < 400ms Capacitor discharge can implement timeout Applications – verify that: a bottle of medicine was sold together with its instructions safety devices were sold together with tools matching parts were delivered together several forms of ID were presented a group of people were present at a meeting Solution Goals Allow readers to be adversarial Make valid proofs improbable to forge Allow verifier to verify the proof off-line Detect replays of valid proofs Theorem f M AC -d G iven random -oracle assum ptionsfor and , the successprobability ofproofforgery by an adversary ofgroup yoking protocolisbounded above by 2 . Notation d * d d * d x x f:{0,1} {0,1} {0,1} M AC :{0,1} {0,1} {0,1} x m f[m ] M AC [m] K eyed hash function: M essage authentication code: C om putation w ith a secret on input : and Key Observation: Passive RFID tags can communicate with each other through the reader. Problem Statement The goal is to generate a proof that a group of passive RFID tags were identified nearly-simultaneously Reader should not be able to forge the proof The proof is efficiently verifiable off-line by a trusted verifier “Yoking”: suggests joining together, or the simultaneous presence of multiple tags. Radio-Frequency Identification (RFID) Radio-Frequency Identification (RFID) Assumptions Tags are passive Tags have limited computational abilities Tags can compute a keyed hash function Tags can maintain some state Verifier is trusted and powerful Key Idea: Construct a circular chain of mutually dependent message authentication code (MAC) computations. 1 3 2 4 5 Key Idea: Split circular chain into a group of arcs , where each arc consists of a sequence of dependent message authentication code (MAC) computations; adjacent arcs are dependent. Speedup requires: multiple readers or a reader with multiple antennas medium access control protocol that avoids collisions Anonymous Yoking algorithm variant: tags keep their identities private. ta g tag antenn a antenna signal Inductive Coupling Far-Field Propagation signal Future Research Future Research Anti-RFID Faraday cage pants pocket RFID-enabled passport RFID-tagged laundry Flexible washer-safe RFID tag Pricing an RFID-tagged sushi meal RFID-enabled secure casino chips Supply chain inventory control with RFID Radio-Frequency Identification (RFID) tag RFID reader starting / closing tags • Develop new RFID “yoking-proofs” where tags communicate with each other through the reader • Reduce the cost of tags to under 5 cents a piece • Provide “good enough” security and privacy guarantees • Standardize the technology for different classes of tags • Devise novel applications that would benefit the society RFID-tagged luggage RFID-enabled documents RFID-operated access control

Upload
malachi-lindsey
Category

Documents
view
15
download
0

Embed Size (px):

description

Generalized “Yoking-Proofs” for a Group of RFID Tags. tag. tag. signal. signal. antenna. antenna. Inductive Coupling. Far-Field Propagation. Department of. Computer Science. University of Virginia. Leonid Bolotnyy and Gabriel Robins. School of Engineering & Applied Science. - PowerPoint PPT Presentation

Transcript of Three types of RFID tags Passive / Active / Semi-Active up to 19m range for UHF

Three types of RFID tags

• Passive / Active / Semi-Active

• up to 19m range for UHF

Computer ScienceComputer ScienceDepartment ofDepartment of

University of VirginiaUniversity of Virginia

Generalized “Yoking-Proofs” Generalized “Yoking-Proofs” for a Group of RFID Tagsfor a Group of RFID Tags

RFID Tag “Yoking-Proofs”RFID Tag “Yoking-Proofs”

Generalized Tag Group “Yoking-Proof”Generalized Tag Group “Yoking-Proof”

Algorithmic SpeedupsAlgorithmic SpeedupsAlgorithmic SpeedupsAlgorithmic SpeedupsGroup Yoking ProtocolGroup Yoking Protocol

[email protected], [email protected] of Engineering & Applied ScienceSchool of Engineering & Applied Science

www.cs.virginia.edu/robins

Leonid Bolotnyy and Gabriel RobinsLeonid Bolotnyy and Gabriel Robins

Timer on-board a tag FCC regulations: protocol termination < 400ms Capacitor discharge can implement timeout

Applications – verify that: a bottle of medicine was sold together with its instructions

safety devices were sold together with tools

matching parts were delivered together

several forms of ID were presented

a group of people were present at a meeting

Solution Goals Allow readers to be adversarial Make valid proofs improbable to forge Allow verifier to verify the proof off-line Detect replays of valid proofs

Theoremf MAC

-d

Given random-oracle assumptions for and ,

the success probability of proof forgery by an adversary

of group yoking protocol is bounded above by 2 .

Notationd * d

d * d

x x

f :{0,1} {0,1} {0,1}

MAC :{0,1} {0,1} {0,1}

x m f [m] MAC [m]

Keyed hash function:

Message authentication code:

Computation with a secret on input : and

Key Observation:

Passive RFID tags can communicate

with each other through the reader.

Problem Statement The goal is to generate a proof that a group of passive RFID

tags were identified nearly-simultaneously Reader should not be able to forge the proof The proof is efficiently verifiable off-line by a trusted verifier

“Yoking”:

suggests joining together, or the simultaneous presence of multiple tags.

Radio-Frequency Identification (RFID)Radio-Frequency Identification (RFID)

Assumptions Tags are passive Tags have limited computational abilities Tags can compute a keyed hash function Tags can maintain some state Verifier is trusted and powerful

Key Idea:

Construct a circular chain of mutually dependent message authentication code (MAC) computations.

Key Idea:

Split circular chain into a group of arcs, where each arc consists of a sequence of dependent message authentication code (MAC) computations; adjacent arcs are dependent.

Speedup requires: multiple readers or a reader with multiple antennas medium access control protocol that avoids collisions

Anonymous Yoking algorithm variant: tags keep their identities private.

tag tag

antenna antenna

signal

Inductive Coupling

Far-Field Propagation

signal

Future ResearchFuture Research

Anti-RFID Faraday cage pants pocket

RFID-enabled passport

RFID-tagged laundry