Lines Matching full:hash

260 with a hash over each node's child nodes. As a result, the index basically also
265 can be hooked to recompute the hash only for each changed node at the same time.
270 keyed hash (HMAC) over its own contents and a hash of the root node of the index
275 include a hash. All other types of nodes will remain unchanged. This reduces
283                              |    (hash)     |
291                             | (hash)    (hash)  |
302             | (hash)    (hash)  |       | (hash)    (hash)  |
311            Figure 3: Coverage areas of index node hash and master node HMAC
316 persist the hash and file contents. Here the existing UBIFS logic for how
319 hashes to index nodes does not change this since each hash will be persisted
329 This is done by creating a continuous hash beginning from the commit start node
333 of the hash chain. That way a journal can be authenticated up to the last
359 Since the hash also includes the reference nodes an attacker cannot reorder or
379 protect the integrity of the full LPT by a simple hash stored in the master
382 LTP hash stored there with the hash computed from the read on-flash LPT.
417 superblock node will additionally store a hash of the authentication key. This