This paper presents a new RFID identification protocol: RIPP-FS. The proposed protocol is based on hash chains and it enforces privacy and forward secrecy. Further, un- like other protocols based on hash chains, our proposal is resilient to a specific DoS attack, in which the attacker at- tempts to exhaust the hash chain the tag is programmed to spend. The computations required on the tag side are very limited, just three hash functions; on the reader side RIPP- FS allows to leverage pre-computations, in such a way that tag identification resolves to a lookup in pre-computed ta- bles, speeding up the identification process. To the best of our knowledge this is the first protocol providing all these features at once.

RIPP-FS: an RFID Identification, Privacy Preserving protocol with Forward Secrecy

CONTI, MAURO;DI PIETRO, ROBERTO;
2007

Abstract

This paper presents a new RFID identification protocol: RIPP-FS. The proposed protocol is based on hash chains and it enforces privacy and forward secrecy. Further, un- like other protocols based on hash chains, our proposal is resilient to a specific DoS attack, in which the attacker at- tempts to exhaust the hash chain the tag is programmed to spend. The computations required on the tag side are very limited, just three hash functions; on the reader side RIPP- FS allows to leverage pre-computations, in such a way that tag identification resolves to a lookup in pre-computed ta- bles, speeding up the identification process. To the best of our knowledge this is the first protocol providing all these features at once.
Proceedings of the Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW) - Workshop on Pervasive Computing and Communication Security
9780769527888
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

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/11577/2477517
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 40
  • ???jsp.display-item.citation.isi??? 27
social impact