Securing low-cost RFID systems: An unconditionally secure approach

Basel Alomair, Loukas Lazos, Radha Poovendran

Research output: Chapter in Book/Report/Conference proceedingChapter

8 Citations (Scopus)

Abstract

We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authentication and random number generation. For parties equipped with a good source of randomness and a secure cryptographic primitive to authenticate messages, the literature of cryptography is rich with well-studied solutions for secure identity authentication. However, the two operations, random number generation and message authentication, can be expensive for low-cost RFID tags. In this paper, we lay down the foundations of a new direction towards solving these problems in RFID systems. We propose an unconditionally secure direction for authenticating RFID systems. We use the fact that RFID readers are computationally powerful devices to design a protocol that allows RFID readers to deliver random numbers to RFID tags in an unconditionally secure manner. Then, by taking advantage of the information-theoretic security of the transmitted messages, we develop a novel unconditionally secure message authentication code that is computed with a single multiplication operation. The goal of this work is to bring more research to the design of such unconditionally secure protocols, as opposed to the computationally secure protocols that have been proposed extensively, for the purpose of suiting the stringent computational capabilities of low-cost devices.

Original languageEnglish (US)
Title of host publicationCryptology and Information Security Series
Pages1-17
Number of pages17
Volume4
DOIs
StatePublished - 2010

Publication series

NameCryptology and Information Security Series
Volume4
ISSN (Print)18716431
ISSN (Electronic)18798101

Fingerprint

Radio frequency identification (RFID)
Authentication
Costs
Random number generation
Security of data
Cryptography

Keywords

  • authentication
  • RFID
  • secrecy
  • unconditional security

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Alomair, B., Lazos, L., & Poovendran, R. (2010). Securing low-cost RFID systems: An unconditionally secure approach. In Cryptology and Information Security Series (Vol. 4, pp. 1-17). (Cryptology and Information Security Series; Vol. 4). https://doi.org/10.3233/978-1-60750-485-6-1

Securing low-cost RFID systems : An unconditionally secure approach. / Alomair, Basel; Lazos, Loukas; Poovendran, Radha.

Cryptology and Information Security Series. Vol. 4 2010. p. 1-17 (Cryptology and Information Security Series; Vol. 4).

Research output: Chapter in Book/Report/Conference proceedingChapter

Alomair, B, Lazos, L & Poovendran, R 2010, Securing low-cost RFID systems: An unconditionally secure approach. in Cryptology and Information Security Series. vol. 4, Cryptology and Information Security Series, vol. 4, pp. 1-17. https://doi.org/10.3233/978-1-60750-485-6-1
Alomair B, Lazos L, Poovendran R. Securing low-cost RFID systems: An unconditionally secure approach. In Cryptology and Information Security Series. Vol. 4. 2010. p. 1-17. (Cryptology and Information Security Series). https://doi.org/10.3233/978-1-60750-485-6-1
Alomair, Basel ; Lazos, Loukas ; Poovendran, Radha. / Securing low-cost RFID systems : An unconditionally secure approach. Cryptology and Information Security Series. Vol. 4 2010. pp. 1-17 (Cryptology and Information Security Series).
@inbook{1d6f115beb5941998a3c7ea0981fc618,
title = "Securing low-cost RFID systems: An unconditionally secure approach",
abstract = "We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authentication and random number generation. For parties equipped with a good source of randomness and a secure cryptographic primitive to authenticate messages, the literature of cryptography is rich with well-studied solutions for secure identity authentication. However, the two operations, random number generation and message authentication, can be expensive for low-cost RFID tags. In this paper, we lay down the foundations of a new direction towards solving these problems in RFID systems. We propose an unconditionally secure direction for authenticating RFID systems. We use the fact that RFID readers are computationally powerful devices to design a protocol that allows RFID readers to deliver random numbers to RFID tags in an unconditionally secure manner. Then, by taking advantage of the information-theoretic security of the transmitted messages, we develop a novel unconditionally secure message authentication code that is computed with a single multiplication operation. The goal of this work is to bring more research to the design of such unconditionally secure protocols, as opposed to the computationally secure protocols that have been proposed extensively, for the purpose of suiting the stringent computational capabilities of low-cost devices.",
keywords = "authentication, RFID, secrecy, unconditional security",
author = "Basel Alomair and Loukas Lazos and Radha Poovendran",
year = "2010",
doi = "10.3233/978-1-60750-485-6-1",
language = "English (US)",
isbn = "9781607504849",
volume = "4",
series = "Cryptology and Information Security Series",
pages = "1--17",
booktitle = "Cryptology and Information Security Series",

}

TY - CHAP

T1 - Securing low-cost RFID systems

T2 - An unconditionally secure approach

AU - Alomair, Basel

AU - Lazos, Loukas

AU - Poovendran, Radha

PY - 2010

Y1 - 2010

N2 - We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authentication and random number generation. For parties equipped with a good source of randomness and a secure cryptographic primitive to authenticate messages, the literature of cryptography is rich with well-studied solutions for secure identity authentication. However, the two operations, random number generation and message authentication, can be expensive for low-cost RFID tags. In this paper, we lay down the foundations of a new direction towards solving these problems in RFID systems. We propose an unconditionally secure direction for authenticating RFID systems. We use the fact that RFID readers are computationally powerful devices to design a protocol that allows RFID readers to deliver random numbers to RFID tags in an unconditionally secure manner. Then, by taking advantage of the information-theoretic security of the transmitted messages, we develop a novel unconditionally secure message authentication code that is computed with a single multiplication operation. The goal of this work is to bring more research to the design of such unconditionally secure protocols, as opposed to the computationally secure protocols that have been proposed extensively, for the purpose of suiting the stringent computational capabilities of low-cost devices.

AB - We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authentication and random number generation. For parties equipped with a good source of randomness and a secure cryptographic primitive to authenticate messages, the literature of cryptography is rich with well-studied solutions for secure identity authentication. However, the two operations, random number generation and message authentication, can be expensive for low-cost RFID tags. In this paper, we lay down the foundations of a new direction towards solving these problems in RFID systems. We propose an unconditionally secure direction for authenticating RFID systems. We use the fact that RFID readers are computationally powerful devices to design a protocol that allows RFID readers to deliver random numbers to RFID tags in an unconditionally secure manner. Then, by taking advantage of the information-theoretic security of the transmitted messages, we develop a novel unconditionally secure message authentication code that is computed with a single multiplication operation. The goal of this work is to bring more research to the design of such unconditionally secure protocols, as opposed to the computationally secure protocols that have been proposed extensively, for the purpose of suiting the stringent computational capabilities of low-cost devices.

KW - authentication

KW - RFID

KW - secrecy

KW - unconditional security

UR - http://www.scopus.com/inward/record.url?scp=84865498114&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84865498114&partnerID=8YFLogxK

U2 - 10.3233/978-1-60750-485-6-1

DO - 10.3233/978-1-60750-485-6-1

M3 - Chapter

AN - SCOPUS:84865498114

SN - 9781607504849

VL - 4

T3 - Cryptology and Information Security Series

SP - 1

EP - 17

BT - Cryptology and Information Security Series

ER -