2013
DOI: 10.1007/978-3-642-36140-1_2
|View full text |Cite
|
Sign up to set email alerts
|

Yet Another Ultralightweight Authentication Protocol That Is Broken

Abstract: Eghdamian and Samsudin published at ICIEIS 2011 an ultralightweight mutual authentication protocol that requires few bitwise operations. The simplicity of the design makes the protocol very suitable to low-cost RFID tags. However, we demonstrate in this paper that the long-term key shared by the reader and the tag can be recovered by an adversary with a few eavesdropped sessions only.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(16 citation statements)
references
References 8 publications
0
16
0
Order By: Relevance
“…Since 2006, numerous UMAPs have been proposed for the EPC C1G2 identification system. However, most of these protocols were very weak and were found to be vulnerable within one year of their introduction [19,42,43]. The reason behind this hasty failure was lack of compact security analysis of the protocol at the design stage.…”
Section: Cryptanalysis Models For Umapsmentioning
confidence: 99%
“…Since 2006, numerous UMAPs have been proposed for the EPC C1G2 identification system. However, most of these protocols were very weak and were found to be vulnerable within one year of their introduction [19,42,43]. The reason behind this hasty failure was lack of compact security analysis of the protocol at the design stage.…”
Section: Cryptanalysis Models For Umapsmentioning
confidence: 99%
“…In the period shortly after the introduction of this paper, three papers were presented that they penetrated to this approach. In [2] traceability attack is carried out. In [3] Disclosure attack was carried out and [4] proved RAPP protocol is not resistance against DE synchronization attack.…”
Section: Rated Workmentioning
confidence: 99%
“…Suppose that are the bases for L and are the set of vectors for L. Can be written any wj for lattice as follows: (2) In above equation all coefficients are the integer number. Both available bases of L lattice are interrelated and interdependent with a matrix has integer numbers elements and determinant.…”
Section: A Mathematically Definedmentioning
confidence: 99%
“…The first one [12] is a traceability attack which exploits Hamming weight-invariant property of the foregoing permutation. The next one [13] is an active full disclosure attack which requires about 2 30 counterfeit authentication session with the victim tag.…”
Section: Introductionmentioning
confidence: 99%