Research And Design Of The RFTD Authentication Protocol

RFID is a wireless identification technology which can be used widely in the field of logistics system, is used first in World War II as the Identification friend or foe. Nowadays it is used in transportation, production management, military fields. However, RFID technology still exists some security problems due to the opening of network environment, such as impersonate, eavesdrop, relay attack, etc. So the best way to solve these threats is to adopt the authentication protocol on the cryptography so that we can make the security target of RFID applications. At the beginning of research, hash functions, symmetric encryption schemes and hard problems based on RSA and discrete logarithm are utilized widely in RFID applications. However, ways we mentioned above have their limitation respectively when adopted in actual scenes. In recent years, RFID applications based on Elliptic Curve Cryptography(ECC) has received extensive attention and study. Compared with the other public key cryptosystems, ECC can still provide better efficiency and security property under the same security level. Therefore, academic and industrial fields is dedicating how to design secure protocol for RFID applications based on ECC.Every coin has two sides, the protocols based on ECC indeed provide better efficiency. However, they could not protect privacy from all security threats once for all. Based on the above facts, researchers will have to utilize some cryptographic primitives with high costs to satisfay the demands of different security requirement when they design protocols of RFID applications Based on ECC. However, the way above will increase the computation cost for devices in RFID system certainly. This paper mainly focuses on how to desire RFID applications which achieve the goals having better efficiency and security level. which has important theoretical value and practical significance. Our protocols achieve same security level and decrease the computation cost for devices in RFID system, compared to two basic ecc-based protocols.The main contributions in our paper are depicted as follows:(1) We analyze the ecc-based grouping-prove protocols of RFID and find some problems they exist. First, the number of interactive round between tags and readers is too much. Second, the time complexity of algorithms can be reduced. We adopt aggregate signature scheme to provide batch verifications between tags and readers. At the same time, our ecc-based grouping-prove protocol has better efficiency and fewer rounds of communication. Note that our scheme provides same security level with original scheme. Moreover, unlike the existing scheme, the certification of different tags and reader in our scheme is independent.This feature is more suitable for RFID system which has loose coupling tags. Final, we proved the protocol's correctness and security, further more,we analyze its efficiency. The ways above shows that our protocol has advantages compared with the origin protocol.(2) We analyze the distance-bounding authentication of RFID system and promote the efficiency of original authentication scheme. The original scheme provides distance-bounding authentication under the assistance of cryptographic primitives with high costs, such as Homomorphic Encryption(HE) and Non-Interactive Zero-Knowledge(NIZK). This brings huge costs to the protocol. Ours based on this scheme provide same security level, such as correctness, soundness, man-in-middle attack and tags anonymity without cryptographic primitives, and have a higher efficiency.(3)We evaluate the performance of our two schemes which utilize C language and Pairing-Based Cryptography(PBC) library. The results show that the conclusion we drawed based on above research is correct.