An improved proof for RFID tags

Nuamcherm, T.; Kovintavewat, Piya; Tantibundhit, Charturong; Ketprom, U.; Mitrpant, C.

doi:10.1109/ecticon.2008.4600536

Cited by 6 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the previous paper, an improved proof for RFID tags has been proposed [6][7], as illustrated in Figure 3. The protocol begins when the reader receives a random data r from the server.…”

Section: An Improved Proofmentioning

confidence: 99%

See 1 more Smart Citation

A High Stability Grouping-proof Protocol for RFID Tags

Pan¹,

Huang²,

Chunhong³

et al. 2017

dtetr

View full text Add to dashboard Cite

Grouping proof is a technique that proves the co-existence of multiple RFID tags simultaneously in the RFID system. Grouping proof can be used in various applications, such as supply chain management, pharmaceutical distribution. A lot of RFID grouping-proof protocols have been presented by many researchers. However, the previous protocols suffer from the replay attack, and ignore an important issue that the protocol will be stop when one of the tags in the group broke down. We proposed a new protocol which is different from any previous work, because it will be continue to carry out by using time stamp when the tag broke down. Compared with previous protocols, the new protocol has high stability and can count the number of legal tags. Besides, it has good security and blocks replay attack, based on technical analysis.

show abstract

Section: An Improved Proofmentioning

confidence: 99%

“…Cho and Yeo presented "Enhanced Yoking Proof Protocol" and said that it makes replay attack difficult [5]. And then an improved proof for RFID tags has been proposed which requires the reader legality should be authenticated [6][7].…”

Section: Introductionmentioning

confidence: 99%

A High Stability Grouping-proof Protocol for RFID Tags

Pan¹,

Huang²,

Chunhong³

et al. 2017

dtetr

View full text Add to dashboard Cite

show abstract

“…Table 2 shows that the grouping proof proposed in this study can protect against all major attacks currently in use. In the method proposed by Saito et al [ 13 ], the tags generate messages but do not use random numbers that change for every message; consequently, malicious users can generate counterfeit tags by replaying old messages to generate grouping proofs [ 18 , 27 , 31 ]. The method proposed by Huang and Ku [ 44 ] can be exploited by replacing parts of the pieces of proof to forge tags [ 26 , 45 ] and authentication can be avoided if the verifier has listed tag as redundant in its cyclic redundancy check.…”

Section: Security and Performance Analysismentioning

confidence: 99%

“…In addition, parallel computing accelerates the generation of grouping proofs. Jantarapatin, Mitrpant, Tantibundhit, Nuamcherm, and Kovintavewat [ 30 ] and Nuamcherm, Kovintavewat, Tantibundhit, Ketprom, and Mitrpant [ 31 ] have improved the security of message requests for grouping proofs by enabling mobile readers to directly broadcast the random number incorporated in the tags. All tags must simultaneously use both the key shared by the verification server and encrypt to obtain the random number sent by the reader in order to obtain protocol for generating the pieces of proof.…”

Section: Introductionmentioning

confidence: 99%

A Novel Multilayered RFID Tagged Cargo Integrity Assurance Scheme

Yang

Luo

2015

Sensors

View full text Add to dashboard Cite

To minimize cargo theft during transport, mobile radio frequency identification (RFID) grouping proof methods are generally employed to ensure the integrity of entire cargo loads. However, conventional grouping proofs cannot simultaneously generate grouping proofs for a specific group of RFID tags. The most serious problem of these methods is that nonexistent tags are included in the grouping proofs because of the considerable amount of time it takes to scan a high number of tags. Thus, applying grouping proof methods in the current logistics industry is difficult. To solve this problem, this paper proposes a method for generating multilayered offline grouping proofs. The proposed method provides tag anonymity; moreover, resolving disputes between recipients and transporters over the integrity of cargo deliveries can be expedited by generating grouping proofs and automatically authenticating the consistency between the receipt proof and pick proof. The proposed method can also protect against replay attacks, multi-session attacks, and concurrency attacks. Finally, experimental results verify that, compared with other methods for generating grouping proofs, the proposed method can efficiently generate offline grouping proofs involving several parties in a supply chain using mobile RFID.

show abstract

“…Later, Piramuthu proposed a "Modified proof" [6] but it is still vulnerable to the attack if the adversary knows the nonce sent by the server. Recently, we proposed a proof [1], which is more secure and can resolve this problem. In this consecutive paper, we analyse the efficiency and security of these authentication schemes in terms of communication bandwidth and the size of memories used for the scheme, computation cost and the number of queries that the adversary requires to perform the attack.…”

Section: Introductionmentioning

confidence: 96%

Performance comparison of the authentication protocols in RFID system

Jantarapatin

Mitrpant

Tantibundhit

et al. 2010

Proceedings of the International Conference on Management of Emergent Digital EcoSystems

View full text Add to dashboard Cite

Radio frequency identification (RFID) is a technology for automated identification, which consists of a reading device, a server and RFID tags. We are interested in authentication protocols where two tags are simultaneously scanned by an RFID reader. Although there are several authentication protocols proposed in literature, some of them are insecure. This paper analyses the security of the authentication protocols based on two possible attacks: the brute-force attack against the proof and the forgery attack by using an authorised reader interacting with RFID tags. We also evaluate these protocols in terms of computation costs, communication costs and the resources used by adversary to run the attack (e.g., the size of memories and the number of queries). The results from our analysis indicate that our proposed protocol is more secure than the others and provides a countermeasure against forgery attack.

show abstract

An improved proof for RFID tags

Cited by 6 publications

References 7 publications

A High Stability Grouping-proof Protocol for RFID Tags

A High Stability Grouping-proof Protocol for RFID Tags

A Novel Multilayered RFID Tagged Cargo Integrity Assurance Scheme

Performance comparison of the authentication protocols in RFID system

Contact Info

Product

Resources

About