Journal
WIRELESS PERSONAL COMMUNICATIONS
Volume 94, Issue 4, Pages 2925-2936Publisher
SPRINGER
DOI: 10.1007/s11277-016-3756-0
Keywords
RFID; Authentication; Anonymity; Elliptic curve cryptography; Tracking; Diffie-Hellman
Categories
Funding
- Ministry of Science and Technology, Taiwan, R.O.C. [MOST 105-2221-E-260-014]
Ask authors/readers for more resources
The challenge of authentication for radio frequency identification (RFID) with low computing capacities call for computation-efficient authentication that can achieve mutual authentication, anonymity, and tracking resistance. The excellent performance of elliptic curve cryptography (ECC) including its strong security, its small key size and efficient computation has attracted many researchers' attention in designing RFID authentication. Recently there are several promising ECC-based RFID authentication schemes aimed at achieving the above functions. Despite of their good performance in terms of computation and general security properties, we find that they all fall in the same security pitfall-being vulnerable to active tracking. In this paper, we identify these weaknesses and then propose a new ECC-based RFID authentication which conquers the weakness and even improves the computational performance.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available