Scalable RFID Pseudonym Protocol

Song, Boyeon; Mitchell, Chris J.

doi:10.1109/nss.2009.15

Cited by 24 publications

(18 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[13] is a recently proposed protocol which claims to assure the untraceability, authentication, and robustness against replay and spoofing attacks. SSM assumes that the channel between the reader and the back-end server is secure, hence DB is considered as a single entity consists of the back-end server and the reader.…”

Section: Review Of the Protocolsmentioning

confidence: 99%

“…A summary of SSM protocol is seen in Fig. 1, where an in depth description could be find in [13]. Notice that on the condition whether x is equal to x m or not, SSM puts the tags in two states.…”

Section: Review Of the Protocolsmentioning

confidence: 99%

“…Recently, new security protocols [10,11,13,14] have been proposed to reduce the computational load on the back-end database. In general, these protocols use look-up tables to find the match in the search process, so they need only O(1) effort to identify a tag.…”

mentioning

confidence: 99%

“…The first protocol is due to Song and Mitchell [13] denoted by SSM (Scalable Song Mitchell protocol) where the second protocol, LRMAP, is presented by Ha et al [14]. Our first observation is that both protocols define two states for the tags to achieve scalability and efficiency at the server side.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Scalability and Security Conflict for RFID Authentication Protocols

Erguler

Anarım

2010

Wireless Pers Commun

View full text Add to dashboard Cite

RFID technology continues to flourish as an inherent part of virtually every ubiquitous environment. However, it became clear that the public-implying the industryseriously needs mechanisms emerging the security and privacy issues for increasing RFID applications. As the nodes of RFID systems mostly suffer from low computational power and small memory size, various attempts which propose to implement the existing security primitives and protocols, have ignored the realm of the cost limitations and failed. In this study, two recently proposed protocols-SSM and LRMAP-claiming to meet the standard privacy and security requirements are analyzed. The design of both protocols based on defining states where the server authenticates the tag in constant time in a more frequent normal state and needs a linear search in a rare abnormal states. Although both protocols claim to provide untraceability criteria in their design objectives, we outline a generic attack that both protocols failed to fulfill this claim. Moreover, we showed that the SSM protocol is vulnerable to a desynchronization attack which prevents a server from authenticating a legitimate tag. Resultantly, we conclude that defining computationally unbalanced tag states yields to a security/scalability conflict for RFID authentication protocols.

show abstract

Section: Review Of the Protocolsmentioning

confidence: 99%

Section: Review Of the Protocolsmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Scalability and Security Conflict for RFID Authentication Protocols

Erguler

Anarım

2010

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…Consequently, in the last decade several RFID security protocols like in [1][2][3][4][5][6][7][8][9][10][11][12][13] have been presented and their security analysis have been investigated in various studies such as [14][15][16][17][18][19][20]. Although the mechanisms and details of each scheme can differ from each other dramatically, majority of these protocols have only focused on the security of the communication channel between the tags and the readers, since it is usually assumed that the readers and the back-end server are considered as a single and unique entity.…”

mentioning

confidence: 99%

Subtle Flaws in the Secure RFID Tag Searching Protocol: SRTS

Erguler

2016

Wireless Pers Commun

View full text Add to dashboard Cite

Secure RFID searching emerged as a new application field in RFID systems finds out whether a specific RFID tag is nearby within a group of tags in a secure manner. Although numerous RFID authentication protocols have been proposed in different studies, RFID searching has not drawn much attention from the RFID community. Also, most of the existing RFID searching protocols do not comply with the EPC Class-1 Gen2 standard, because their designs employ hardware complex cryptographic primitives such as hash functions or complicated encryption schemes. Recently, Sundaresan et al. has introduced an ultra-lightweight secure RFID searching protocol which only requires a Pseudo Random Number Generator and XOR encryption, i.e. it can be implemented on low-cost EPC Class-1 Gen2 compliant RFID tags. The authors present a detailed security analysis of their protocol to prove its security correctness and they claim that the protocol fulfills the security and privacy requirements. In this study, however, we describe tracking, replay and tag impersonation attacks that show the protocol fails to bear out some of its privacy and security objectives.

show abstract

Evaluation of Vulnerabilities in IoT‐Based Intelligent Agriculture Systems

Phasinam

Kassanuk

2022

Autonomous Vehicles Volume 2

View full text Add to dashboard Cite

Scalable RFID Pseudonym Protocol

Cited by 24 publications

References 13 publications

Scalability and Security Conflict for RFID Authentication Protocols

Scalability and Security Conflict for RFID Authentication Protocols

Subtle Flaws in the Secure RFID Tag Searching Protocol: SRTS

Evaluation of Vulnerabilities in IoT‐Based Intelligent Agriculture Systems

Contact Info

Product

Resources

About