طرح ناشناس گواهی مستقیم بهبود یافته برای شبکه های M2M

The remote anonymous trusted authentication of M2 M equipments is a key problem in Internet of Things system. The Direct Anonymous Attestation (DAA) protocol had been adopted by TCG to implement the attestation of the trusted platform. Limited by the deficient computing and storing resources of most embedded devices, a new improved DAA (I-DAA) scheme is proposed to be applied in M2 M networks. The proposed I-DAA scheme not only retains the security of the legacy DAA, but also greatly reduces the computational complexity, which makes it more suitable for M2 M networks.

M2M (Machine to Machine) networks are new research hotspot in Internet of Things system [1]. The security requirements in M2M systems are urgent to be solved. Thus, it is important to introduce the trusted computing framework into M2M networks. The core part of a trusted computing system is Trusted Platform Module (TPM).which is a security chip with physical tamper preventing, encryption, decryption, and other functions. One of the basic questions related to TPM is the attestation of TPM. In order to protect the privacy of TPM and the information integrity, TCG proposed a solution called Privacy CA scheme [2] in TPM standard v1.1 and DAA (Direct Anonymous Attestation) scheme [3] in TPM standard v1.2. Although the Privacy CA scheme is simple, it has two apparent weaknesses [4]. To solve these two problems, the DAA scheme is proposed. But the traditional DAA scheme includes lots of zero-knowledge proof and complex calculation, which make it not suitable for embedded devices, such as M2M equipment, cell phones, etc. A lot of research has been done to improve the DAA schemes [5], [6], [7]. [8], [9]. We propose a new Improved DAA (I-DAA) scheme in this paper. This paper is organized as follows. In Section 2, we give a brief analysis of these existing schemes. We describe the related mathematical fundamentals needed in Section 3 and the I-DAA scheme will be described in Section 4. In Section 5, security proofs are presented. Efficiency analysis and comparisons are described in Section 6 and conclusions are given in Section 7.