Research On Quantum-Resistant And Lightweight Authentication Protocols In IoT

With the rapid development and popularization of IoT(Internet of Things),which brings great convenience to our life,but it also brings a considerable challenge to the data privacy and security.In IoT,it contains some resource-constrained devices which lack adequate capacity to complete complex computation tasks and store the necessary data.To guarantee the communication between resource-constrained devices and server,we need to use the cryptography technology to protect them.However,the consumption of traditional cryptography is too heavy that does not fit for the resourceconstrained devices in IoT.Meanwhile,along with the development of quantum computing,it owns a powerful parallel computation capacity which can quickly solve the complex math problems that form the foundation of traditional cryptography.It poses a great threat to the current cryptographic system.Therefore,how to design a quantumresistant,lightweight cryptographic protocol for IoT environment has attracted considerable attentions.The hardness of LPN(Learning Parity with Noise)problem is a security problem in quantum computing model,which can resist not only traditional attacks,but also quantum attacks.And also,it is very elegant in structure and simple to implement.Therefore,based on the hardness of LPN problem,we propose quantum-resistant and lightweight AKA(Authentication and Key Agreement)protocol and grouping-proof protocol for different IoT applications.Concretely,the contributions are summarized as follows:(1)Investigate the relationship between microgrids and the main grid,we design a quantum-resistant and lightweight authentication and key agreement protocol.In the proposed protocol,we construct a three layer network based on the fog computing,"end device"—"fog"—"cloudr".In order to protect the communication between end device and fog node,the proposed protocol provides mutual authentication and generates a session key.By analyzing the system model and security model,we formally prove the security of proposed protocol relies on the hardness of LPN problem in the random oracle model.Finally,we setup a simulation environment,the result indicates the computation time is greatly reduced and the efficient is improved.(2)In the RFID(Radio Frequency Identification)system,comply with the EPCglobal C1G2 standard,we propose a lightweight grouping-proof protocol with post-quantum security.The purpose of grouping-proof is to generate an evidence to prove two or more RFID tags in a group are coexistent.In the proposed protocol,2-round interactions between the reader and the tags allow them to cooperate on fast authentication in parallel mode where all tags are performed separately without dependency.Similarly,we formally prove the security of proposed protocol relies on the hardness of LPN problem.Finally,we evaluate the performance of proposed protocol and prove it is more lightweight and efficient.