A secure and scalable identification for hash-based RFID systems using updatable pre-computation

Yasunobu Nohara, Sozo Inoue

研究成果: 著書/レポートタイプへの貢献会議での発言

2 引用 (Scopus)

抄録

In this paper, we propose a secure identification scheme for RFID with efficient time and memory, and also an efficient update of pre-computed values on the server side. Although RFID ( Radio Frequency IDentification ) is becoming popular with pervasive computing environments, a privacy problem still remains, where an adversary can trace users' behavior by linking identification log by adversary readers. For this problem, a hash-chain scheme has been proposed as a secure identification for low-cost RFID tags, and its long identification time has been reduced by Avoine et al. using pre-computation on the server side. However, Avoine's scheme uses static pre-computation, and therefore pre-computed values include ones which are already used and no longer used. An efficient update of pre-computation is needed to remove these wasted values and this can reduce memory usage. In this paper, we optimize a lookup of pre-computed values using d-left hashing, which is a fast lookup technique, and provide efficient update of pre-computed values. We also show reasonable analytical evaluation and experimental result for memory and pre-computation/identification/update time.

元の言語英語
ホスト出版物のタイトルWiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security
ページ65-74
ページ数10
DOI
出版物ステータス出版済み - 5 21 2010
イベント3rd ACM Conference on Wireless Network Security, WiSec'10 - Hoboken, NJ, 米国
継続期間: 3 22 20103 24 2010

出版物シリーズ

名前WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security

その他

その他3rd ACM Conference on Wireless Network Security, WiSec'10
米国
Hoboken, NJ
期間3/22/103/24/10

Fingerprint

Radio frequency identification (RFID)
Identification (control systems)
Data storage equipment
Servers
Ubiquitous computing
Costs

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Safety, Risk, Reliability and Quality

これを引用

Nohara, Y., & Inoue, S. (2010). A secure and scalable identification for hash-based RFID systems using updatable pre-computation. : WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security (pp. 65-74). (WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security). https://doi.org/10.1145/1741866.1741878

A secure and scalable identification for hash-based RFID systems using updatable pre-computation. / Nohara, Yasunobu; Inoue, Sozo.

WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security. 2010. p. 65-74 (WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security).

研究成果: 著書/レポートタイプへの貢献会議での発言

Nohara, Y & Inoue, S 2010, A secure and scalable identification for hash-based RFID systems using updatable pre-computation. : WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security. WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security, pp. 65-74, 3rd ACM Conference on Wireless Network Security, WiSec'10, Hoboken, NJ, 米国, 3/22/10. https://doi.org/10.1145/1741866.1741878
Nohara Y, Inoue S. A secure and scalable identification for hash-based RFID systems using updatable pre-computation. : WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security. 2010. p. 65-74. (WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security). https://doi.org/10.1145/1741866.1741878
Nohara, Yasunobu ; Inoue, Sozo. / A secure and scalable identification for hash-based RFID systems using updatable pre-computation. WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security. 2010. pp. 65-74 (WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security).
@inproceedings{fbe0d555c6e84433b2da21a116802f02,
title = "A secure and scalable identification for hash-based RFID systems using updatable pre-computation",
abstract = "In this paper, we propose a secure identification scheme for RFID with efficient time and memory, and also an efficient update of pre-computed values on the server side. Although RFID ( Radio Frequency IDentification ) is becoming popular with pervasive computing environments, a privacy problem still remains, where an adversary can trace users' behavior by linking identification log by adversary readers. For this problem, a hash-chain scheme has been proposed as a secure identification for low-cost RFID tags, and its long identification time has been reduced by Avoine et al. using pre-computation on the server side. However, Avoine's scheme uses static pre-computation, and therefore pre-computed values include ones which are already used and no longer used. An efficient update of pre-computation is needed to remove these wasted values and this can reduce memory usage. In this paper, we optimize a lookup of pre-computed values using d-left hashing, which is a fast lookup technique, and provide efficient update of pre-computed values. We also show reasonable analytical evaluation and experimental result for memory and pre-computation/identification/update time.",
author = "Yasunobu Nohara and Sozo Inoue",
year = "2010",
month = "5",
day = "21",
doi = "10.1145/1741866.1741878",
language = "English",
isbn = "9781605589237",
series = "WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security",
pages = "65--74",
booktitle = "WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security",

}

TY - GEN

T1 - A secure and scalable identification for hash-based RFID systems using updatable pre-computation

AU - Nohara, Yasunobu

AU - Inoue, Sozo

PY - 2010/5/21

Y1 - 2010/5/21

N2 - In this paper, we propose a secure identification scheme for RFID with efficient time and memory, and also an efficient update of pre-computed values on the server side. Although RFID ( Radio Frequency IDentification ) is becoming popular with pervasive computing environments, a privacy problem still remains, where an adversary can trace users' behavior by linking identification log by adversary readers. For this problem, a hash-chain scheme has been proposed as a secure identification for low-cost RFID tags, and its long identification time has been reduced by Avoine et al. using pre-computation on the server side. However, Avoine's scheme uses static pre-computation, and therefore pre-computed values include ones which are already used and no longer used. An efficient update of pre-computation is needed to remove these wasted values and this can reduce memory usage. In this paper, we optimize a lookup of pre-computed values using d-left hashing, which is a fast lookup technique, and provide efficient update of pre-computed values. We also show reasonable analytical evaluation and experimental result for memory and pre-computation/identification/update time.

AB - In this paper, we propose a secure identification scheme for RFID with efficient time and memory, and also an efficient update of pre-computed values on the server side. Although RFID ( Radio Frequency IDentification ) is becoming popular with pervasive computing environments, a privacy problem still remains, where an adversary can trace users' behavior by linking identification log by adversary readers. For this problem, a hash-chain scheme has been proposed as a secure identification for low-cost RFID tags, and its long identification time has been reduced by Avoine et al. using pre-computation on the server side. However, Avoine's scheme uses static pre-computation, and therefore pre-computed values include ones which are already used and no longer used. An efficient update of pre-computation is needed to remove these wasted values and this can reduce memory usage. In this paper, we optimize a lookup of pre-computed values using d-left hashing, which is a fast lookup technique, and provide efficient update of pre-computed values. We also show reasonable analytical evaluation and experimental result for memory and pre-computation/identification/update time.

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

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

U2 - 10.1145/1741866.1741878

DO - 10.1145/1741866.1741878

M3 - Conference contribution

AN - SCOPUS:77952382134

SN - 9781605589237

T3 - WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security

SP - 65

EP - 74

BT - WiSec'10 - Proceedings of the 3rd ACM Conference on Wireless Network Security

ER -