R. C. Merkle. Protocols for public key cryptography. Proceedings of the IEEE Symposium on Security and Privacy, Apr 1980.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the hash tree scheme for simplicity, but note that there exists a more e#cient scheme that can reduce the performance overhead of memory integrity verification [22] 4.1. 1 Cached Hash Trees Hash trees (or Merkle trees) are often used to verify the integrity of dynamic data in untrusted storage [13]. Figure 2 illustrates a hash tree. The memory space is divided into multiple chunks, denoted by V 1 , V 2 , etc. The chunks are the leaves of the hash tree. A parent is the hash of the concatenation of its children. In our case, each hash covers one L2 cache block. The root of the tree is stored ....

R. C. Merkle. Protocols for public key cryptography. In IEEE Symposium on Security and Privacy, pages 122--134, 1980.

....hash tree scheme for simplicity, but note that there exists a more efficient scheme that can reduce the perfor mance overhead of memory integrity verification [22] 4.1. 1 Cached Hash Trees Hash trees (or Merkle trees) are often used to verify the integrity of dynamic data in untrusted storage [13]. Figure 2 illustrates a hash tree. The memory space is divided into multiple chunks, denoted by V, V, etc. The chunks are the leaves of the hash tree. A parent is the hash of the concatenation of its children. In our case, each hash covers one L2 cache block. The root of the tree is stored in ....

R. C. Merkle. Protocols for public key cryptography. In IEEE Symposium on Security and Privacy, pages 122 134, 1980.

....It is hard to find two distinct messages with the same hash. This property is called collision resistance. which are static for a program, not to data, which dynamically changes. Hash trees (or Merkle trees) are often used to verify the integrity of dynamic data in untrusted storage [12]. Figure 2 illustrates a hash tree. Similar to MAC, the memory space is divided into multiple chunks, denoted by V 1 , V 2 , etc. The chunks are the leaves of the hash tree. A parent is the hash of the concatenation of its children. The root of the tree is stored on chip where it cannot be ....

....However, the cache improves the performance by a few percent by reducing the bandwidth overhead for bandwidth sensitive benchmarks such as mcf, applu, and swim. About 32 block caches are large enough because the cache only exploits the spatial locality of time stamp accesses. 8 Related Work In [12], hash trees were proposed as a means to update and validate data hashes e#ciently by maintaining a tree of hash values over the objects. Blum et al. addressed the problem of securing various data structures in untrusted memory. One scheme is to use a hash tree rooted in trusted memory [1] This ....

R. C. Merkle. Protocols for public key cryptography. In IEEE Symposium on Security and Privacy, pages 122--134, 1980.

....Section 2. The assumed model is presented in Section 3, and motivating applications are the subject of Section 4. An on line caching scheme for memory verification is described in Section 5. Finally, in section 6 we evaluate the schemes on a superscalar processor simulator. 2. Related Work In [12], hash trees were proposed as a means to update and validate data hashes efficiently by maintaining a tree of hash values over the objects. Blum et al. addressed the problem of securing various data structures in untrusted memory. One scheme is to use a hash tree rooted in trusted memory [3] ....

....memory. XOM does a good job of the former, but fails on the latter. Our memory verification techniques would provide XOM with a secure foundation to work on. 5. Integrity Verification Algorithm 5.1. Hash Trees We verify the integrity of memory with a hash tree (also called a Merkle tree, see [12]) In a hash tree, data is located at the leaves of a tree. Each node contains a collision resistant hash of the data that is in each one of the nodes or leaves that are below it. A hash of the root of the tree is stored in secure memory where it cannot be tampered with. Figure 1 shows the ....

R. C. Merkle. Protocols for public key cryptography. In IEEE Symp. on Security and Privacy, pages 122--134, 1980.

No context found.

R. C. Merkle. Protocols for public key cryptography. Proceedings of the IEEE Symposium on Security and Privacy, Apr 1980.

No context found.

R. C. Merkle. Protocols for public key cryptography. In IEEE Symposium on Security and Privacy, pages 122--134, 1980.

No context found.

R. C. Merkle. Protocols for public key cryptography. In IEEE Symposium on Security and Privacy, pages 122--134, 1980.

No context found.

R. C. Merkle. Protocols for public key cryptography. In IEEE Symposium on Security and Privacy, pages 122--134, 1980.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC