Hash trees are a cryptographic data structure used to efficiently and securely verify the contents of large data structures. They are a generalization of hash lists and hash chains, and require computing a number of hashes proportional to the logarithm of the number of leaf nodes in the tree to demonstrate that a leaf node is part of the tree. The concept was patented by Ralph Merkle in 1979.
UC Berkeley
Fall 2022
A graduate-level course surveying modern topics in computer systems security, including secure messaging, blockchain, hardware security, and secure federated computation. It requires completion of CS 162 and CS 161 or equivalent for enrollment.
No concepts data
+ 17 more concepts