Remote attestation mechanism of platform configuration based on dynamic Huffman tree

Fu, Donglai; Peng, Xinguang; Chen, Gouxi; Yang, Qingzhi

doi:10.3724/sp.j.1087.2012.02275

Cited by 2 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the average length of the authentication path is O((n/N)lb(n)) in the same situation, that is, the tree also includes N leaves because the unbalanced tree is always the Huffman tree after executing insertion or update. This proof can be seen in the literature [26].…”

Section: Complexity Of Unbalanced Tree Formationsupporting

confidence: 58%

“…The further discussion on them is omitted. Interested readers can find more information in these papers [23][24][25]. Everything has two sides.…”

Section: Extensions For Scalability and Privacymentioning

confidence: 99%

“…Besides, the list can also result in a high communication load. Thus, some mechanisms [9][10][11][12] based on the Merkle hash tree [13] have been proposed to organize the data efficiently. While previous papers use the balanced tree, the unbalanced tree is superior to the balanced tree in some application scenarios.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Unbalanced tree‐formed verification data for trusted platforms

Peng

Yang

2015

Security Comm Networks

View full text Add to dashboard Cite

Validation is an alternative approach to the establishment of the trust between two or more entities. The validation allows a challenger to evaluate the trustworthiness of an attesting system based on provided evidence. Early attempts show the evidence is always organized in a linear structure or a balanced tree. These methods, however, are not optimal when facing a complex system and privacy issues. In particular, the Stored Measurement Log (SML) to record the execution history of the attesting system brings efficiency, scalability and privacy problems. We attempt to mitigate them through a new algorithm that uses an unbalanced tree to manage the SML. Leaves represent measurement values of components, and the root is protected by platform configuration registers, which is the same as the balanced tree. The location of each node, however, is constantly mutative until the probability distribution of all components tends towards stabilization. The greater the probability of the leaf is, the closer it is to the root, which benefits the validation. We build a prototype program that is developed through the Trusted Platform Module emulator 0.7. We touch on some mechanisms to reduce the size of the tree and avoid privacy leak. Finally, we perform an in-depth analysis of the validation efficiency, and present the impression of the time complexity of the measurement. Results show that the validation obtains the logarithmic speed-up (O((n/N)lb(n))) and that the time complexity of the measurement process is also acceptable. Besides, our scheme demonstrates advantages in privacy protection and scalability.

show abstract

Section: Complexity Of Unbalanced Tree Formationsupporting

confidence: 58%

“…The further discussion on them is omitted. Interested readers can find more information in these papers [23][24][25]. Everything has two sides.…”

Section: Extensions For Scalability and Privacymentioning

confidence: 99%

See 1 more Smart Citation

Unbalanced tree‐formed verification data for trusted platforms

Peng

Yang

2015

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…This promising technique can provide two important services, namely, secure storage and platform attestation. In recent years, we have carried out some research [27][28][29][30][31] into platform attestation and its application for a general computing environment with a plenty of resources.…”

Section: Remote Attestation Based On a Trusted Platform Modulementioning

confidence: 99%

TPM-based remote attestation for Wireless Sensor Networks

Peng

2016

Tinshhua Sci. Technol.

View full text Add to dashboard Cite

It is essential to design a protocol to allow sensor nodes to attest to their trustworthiness for missioncritical applications based on Wireless Sensor Networks (WSNs). However, it is a challenge to evaluate the trustworthiness without appropriate hardware support. Hence, we present a hardware-based remote attestation protocol to tackle the problem within WSNs. In our design, each sensor node is equipped with a Trusted Platform Module (TPM) which plays the role of a trusted anchor. We start with the formulation of remote attestation and its security. The complete protocol for both single-hop and multi-hop attestations is then demonstrated. Results show the new protocol is effective, efficient, and secure.

show abstract

Remote attestation mechanism of platform configuration based on dynamic Huffman tree

Cited by 2 publications

References 0 publications

Unbalanced tree‐formed verification data for trusted platforms

Unbalanced tree‐formed verification data for trusted platforms

TPM-based remote attestation for Wireless Sensor Networks

Contact Info

Product

Resources

About