Integrity Tree

In cryptography,

An integrity tree is a standard method for using a small amount of internal storage to protect a larger amount of data.

From [1]

It uses a tree data structure whose leaves contains cryptographic hashes of the data whose integrity is assessed.

For example, a merkle tree is an integrity tree.

Instead of cryptographic hashes, the integrity can use MAC tags ([1]).

Notes linking here

• A Memory Encryption Engine Suitable for General Purpose Processors
• how does sgx protects my data?

Bibliography

References

Permalink