A New Mutual Authentication Protocol in Mobile RFID for Smart Campus

At present, with the increasingly growing application of Internet of Things, virtualization and intelligent technologies, and the maturity of smart campus systems, campus card technology based on radio frequency identification (RFID) has developed rapidly. Due to the convenience of use, it is widely used in dormitory access control system, book borrowing system, attendance system, and payment system. Because the data carried by the RFID card is more and more complex, the requirements for its security are getting higher and higher. In order to solve the problem of identity authentication and privacy protection of the RFID application existed in the digital campus in recent years, an improved mutual authentication protocol in mobile RFID for smart campus is put forward by analyzing and studying existing smart campus authentication protocols based on hash algorithm, which uses the technology of random number S and time stamp T. This protocol implements mutual authentication among the tag, reader, and backend database without the premise that the signal path between the database and reader communication is a safe signal path and can effectively resist counterfeit attack, replay attack, position tracking attack, de-synchronization attack, eavesdropping attack, denial of service attack, and man-in-the-middle attack, and it can also guarantee forward security. Due to the large data operations and storage have been transferred to readers and backend data, the protocol is formally proved to have a strong reliability and a good security. In addition, through the comparison with other existing authentication protocols on the resident variable storage overhead, the cost of computing complexity and the security performance, the authentication protocol proposed in this paper has a better storage and calculation performance, and it can better satisfy the security requirements in mobile RFID applications for smart campus in the future and has a good application prospect.