Research On Group Security Scheme Of Machine Type Communication

Machine Type Communication(MTC)is a technology that enables all machines to have the ability of networking and communication.It is the key technology to realize the Internet of Things(Io T)and has a wide application prospect and value.With the broader application of Machine Type Communication in the network,the security problem has become the focus of attention.The traditional one-to-one security scheme can ensure the confidentiality and integrity of data and protect users' privacy data.However,it will lead to core network congestion or even overload when massive devices access to network,which will affect the communication efficiency and service quality.In addition,under the influence of big data communication,one device often participates in multi task cooperation and carries multiple authentication keys,which increases the storage burden.Focusing on the congestion caused by massive devices accessing to the network,the work is carried out around the identity authentication,key agreement and key generation,which are summarized as follows:Firstly,a MTC asynchronous group authentication scheme is proposed based on El Gamal encryption algorithm and Shamir's(k,n)threshold scheme.This scheme can authenticate multiple devices at one time,generate session key and support asynchronous communication.Compared with other schemes,the proposed scheme has less bandwidth consumption,less calculating time and less storage burden.Secondly,a MTC group authentication scheme based on binary polynomial is proposed.This scheme can realize bidirectional authentication between the device and network,and generate the session key.At the same time,the integrity of authentication information sent to each other is guaranteed,that forward security and backward security are supported.Experiments show the security of this scheme,which also can effectively reduce authentication delay.Besides,the formal analysis tool BAN logic is used to verify the validity and security of the generated session key.Finally,this thesis studies and proposes a key sharing scheme in multi-task cooperation studies.Considering the same device often participates in multi-task cooperation,it needs to carry multiple independent authentication keys at the same time,which increases the storage burden.Based on Congruence Equations and(k,n)threshold scheme,we propose a key sharing scheme among multiple security schemes,in which only one key is carried by the devices participating in multiple tasks.Experiments show that the scheme can effectively reduce the storage burden of the device.