R FID Authentication : M inimizing Tag Computation

1. RFID Authentication : Minimizing Tag Computation CHES2006 Rump Session, Yokohama. Japan 2006. 10. 11. Ph.D.Jin Kwak Kyushu University, JAPAN jkwak@security.re.kr or jkwak@itslab.csce.kyushu-u.ac.jp

2. Background - Definition of RFID RFID (Radio Frequency Identification) is data carrier technology that transmits information via signal in the radio frequency portion of the electromagnetic spectrum. [GS1 US] RFID- Radio Frequency Identification

3. Limitation of Current RFID Computation Storage 5¢ RFID tag cannot implement - symmetric key cryptography - public key cryptography - hash operation - random number generation Low-cost RFID tag has hundreds of bits-memory - EPC C0/0+, EPC Cl G1, EPC C1G2 tag has tens of bits R/W block - Philips’ UCODE EPC G2 tag has 512 bits of on chip memory Security or Efficiency? Computation or Storage?

4. Assumptions Limited successivetag queries The probability that an attacker can successively transmit a Query to targeted RFID tags in different locations before updating the RFID tags’ identification data is very low Limited interleaving The mobility of RFID tags and password mechanism restrict the attacker’s ability to perform attack

5. Initial Set-up Process

6. Authentication Process(1/2)

7. Authentication Process(2/2) … … …

8. Security Without PW, the attackers cannot obtain ID Week anonymity By assumptions, tracking probability is very low Strong anonymity The attackers cannot use the clone without PW Anti-counterfeiting DoS is easily detected Recognizability

9. Efficiency RFID tag only perform XOR operations Low computation RFID tag needs under 300 bits memory Small storage

10. Thanks … Please e-mail to jkwak@security.re.krorjkwak@itslab.csce.kyushu-u.ac.jp