In the next future Radio Frequency IDentiflcation (RFID) systems will be so pervasive that everyone will wear (maybe unawares) a kit of personal tags. However, a major concern that prevents a wide diffusion of this emerging technology is privacy. Several proposed protocols try to solve the privacy issue, but are exposed to many others security flaws, such as denial of service or lack of forward secrecy. One recently proposed solution addressing all these problems is RIPP-FS: an RFID identification protocol that guarantees privacy, authentication and forward secrecy, allowing the reading of many tags at once. While efficient, RIPP-FS requires some extra computations on the tag side when a tag misses several consecutive queries from the reader. In this paper we propose FastRIPP, an efficient protocol that significantly reduces the exposed overhead. This improvement is inspired by an efficient hash traversal amortization technique that uses fractal hash sequence representation. We analyzed the performances of the proposed protocol compared with the original version of RIPP-FS. The results of extensive simulations confirm the gain of performance of the proposed protocol. Finally, note that the proposed solution could be adopted by other RFID identification protocols as well. ©2007 IEEE.

FastRIPP: RFID privacy preserving protocol with forward secrecy and fast resynchronisation / Conti, Mauro; Roberto Di, Pietro; Mancini, Luigi Vincenzo; Spognardi, Angelo. - (2007), pp. 52-57. (Intervento presentato al convegno 33rd Annual Conference of the IEEE Industrial Electronics Society, IECON tenutosi a Taipei; Taiwan, Province of China nel 5 November 2007 through 8 November 2007) [10.1109/iecon.2007.4460365].

FastRIPP: RFID privacy preserving protocol with forward secrecy and fast resynchronisation

CONTI, MAURO;MANCINI, Luigi Vincenzo;SPOGNARDI, Angelo
2007

Abstract

In the next future Radio Frequency IDentiflcation (RFID) systems will be so pervasive that everyone will wear (maybe unawares) a kit of personal tags. However, a major concern that prevents a wide diffusion of this emerging technology is privacy. Several proposed protocols try to solve the privacy issue, but are exposed to many others security flaws, such as denial of service or lack of forward secrecy. One recently proposed solution addressing all these problems is RIPP-FS: an RFID identification protocol that guarantees privacy, authentication and forward secrecy, allowing the reading of many tags at once. While efficient, RIPP-FS requires some extra computations on the tag side when a tag misses several consecutive queries from the reader. In this paper we propose FastRIPP, an efficient protocol that significantly reduces the exposed overhead. This improvement is inspired by an efficient hash traversal amortization technique that uses fractal hash sequence representation. We analyzed the performances of the proposed protocol compared with the original version of RIPP-FS. The results of extensive simulations confirm the gain of performance of the proposed protocol. Finally, note that the proposed solution could be adopted by other RFID identification protocols as well. ©2007 IEEE.
2007
33rd Annual Conference of the IEEE Industrial Electronics Society, IECON
Annual conference; Denial-of -service; Emerging technologies
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
FastRIPP: RFID privacy preserving protocol with forward secrecy and fast resynchronisation / Conti, Mauro; Roberto Di, Pietro; Mancini, Luigi Vincenzo; Spognardi, Angelo. - (2007), pp. 52-57. (Intervento presentato al convegno 33rd Annual Conference of the IEEE Industrial Electronics Society, IECON tenutosi a Taipei; Taiwan, Province of China nel 5 November 2007 through 8 November 2007) [10.1109/iecon.2007.4460365].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/367295
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 6
social impact