It is desirable that Venti employ a cryptographic hash function. For such a function, it is computationally infeasible to find two distinct inputs that hash to the same value. This property is important because it prevents a malicious client from intentionally creating blocks that violate the assumption that each block has a unique fingerprint. As an additional benefit, using a cryptographic hash function strengthens a client's integrity check, preventing a malicious server from fulfilling a read request with fraudulent data. If the fingerprint of the returned block matches the requested fingerprint, the client can be confident the server returned the original data.
2. What really happens during a hash collision? Include an image.
hash collision is a measurement whose purpose is to detect very slight changes to data, or to determine whether or not two pieces of data are identical. Cryptographically useful hashing functions have some specific characteristics.
3. What are the ways and methods to resolve hash collision? Explain Each
In a well-dimensioned hash table, the average cost (number of instructions) for each look up is independent of the number of elements stored in the table. Many hash table designs also allow arbitrary insertions and deletions of key-value pairs, at constant average.
Hash collisions are practically unavoidable when hashing a random subset of a large set of possible keys.
Walang komento:
Mag-post ng isang Komento