A low-resource public-key identification scheme for RFID tags and sensor nodes

Yossef Oren, Martin Feldhofer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

46 Scopus citations

Abstract

We revisit a public key scheme presented by Shamir in [19] (and simultaneously by Naccache in [15]) and examine its applicability for general-purpose RFID tags in the supply chain. Using a combination of new and established space-saving methods, we present a full-fledged public key identification scheme, which is secure yet highly efficient. The 1024-bit scheme fits completely (including RAM) into 4682 gate equivalents and has a mean current consumption of 14.2 μA. The main novelty in our implementation is the replacement of the long pseudo-random sequence, originally stored on 260 bytes of EEPROM in [19], by a reversible stream cipher using less than 300 bits of RAM. We show how our scheme offers tag-to-reader and reader-to-tag authentication and how it can be fit into the existing RFID supply chain infrastructure.

Original languageEnglish
Title of host publicationProceedings of the 2nd ACM Conference on Wireless Network Security, WiSec'09
Pages59-68
Number of pages10
DOIs
StatePublished - 21 Sep 2009
Externally publishedYes
Event2nd ACM Conference on Wireless Network Security, WiSec'09 - Zurich, Switzerland
Duration: 16 Mar 200918 Mar 2009

Publication series

NameProceedings of the 2nd ACM Conference on Wireless Network Security, WiSec'09

Conference

Conference2nd ACM Conference on Wireless Network Security, WiSec'09
Country/TerritorySwitzerland
CityZurich
Period16/03/0918/03/09

Keywords

  • Hardware implementation
  • Public-key encryption
  • RFID technology
  • Rabin encryption

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Fingerprint

Dive into the research topics of 'A low-resource public-key identification scheme for RFID tags and sensor nodes'. Together they form a unique fingerprint.

Cite this