2013
DOI: 10.1007/s11277-013-1552-7
|View full text |Cite
|
Sign up to set email alerts
|

Simulation-Based Traceability Analysis of RFID Authentication Protocols

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(11 citation statements)
references
References 19 publications
0
11
0
Order By: Relevance
“…Simple-weight algorithms use hash functions that are also not feasible for passive tag resources. Lightweight algorithms use simple one-way hash functions, cyclic redundancy checks, and pseudo-random number generators [ 10 ]. Finally, ultra-lightweight algorithms use bitwise operations, which can be performed at low cost.…”
Section: Review Of Recent Rfid Authentication Protocolsmentioning
confidence: 99%
See 1 more Smart Citation
“…Simple-weight algorithms use hash functions that are also not feasible for passive tag resources. Lightweight algorithms use simple one-way hash functions, cyclic redundancy checks, and pseudo-random number generators [ 10 ]. Finally, ultra-lightweight algorithms use bitwise operations, which can be performed at low cost.…”
Section: Review Of Recent Rfid Authentication Protocolsmentioning
confidence: 99%
“…Fernando and Abawajy [ 22 ] proposed a mutual authentication protocol for Networked RFID Systems NRS, which is a lightweight mutual authentication scheme for an RFID system using low operations such as excusive or operation (XOR) and one-way hash functions. However, Alagheband and Aref [ 10 ] reported NRS to be vulnerable to major attacks and specifically a full disclosure attack that compromises the whole RFID system. Alagheband and Aref improved NRS protocol and proposed NRS+ by adding three more hash functions to the authentication message to increase the system security.…”
Section: Review Of Recent Rfid Authentication Protocolsmentioning
confidence: 99%
“…Various formal privacy models [14][15][16][17] are utilized to prove safety property of RFID protocol via different oracles. In this paper, we practically adopt the existing formal privacy model [18]. Thus, we enhance the model to analyze forward/backward traceability of the improved protocol with different assumptions.…”
Section: Related Workmentioning
confidence: 99%
“…In this paper, we enhance the existing formal privacy Vaudenay model [18]. Thus, we practically define strong forward untraceable and backward untraceable based on Vaudenay model.…”
Section: Adversarial Modelmentioning
confidence: 99%
“…For example, the key disclosure attack in protocol is an attack that the current messages of the tag and monitored and the current and next run's keys should be revealed by an attacker. Besides, forward and backward untraceable is introduced in [7], where the attacker run the current protocol and obtain the future and the past secret keys of the target tag.…”
Section: Introductionmentioning
confidence: 99%