Imagine I only have the hash of a file which we can call
hash(file). Then a user sends me a data block (or section) of the same file, which we can call
section1(file). Is there a way to verify that such section belongs to the file, given only the hash of it?
I was thinking of constructing a Merkle tree. So the
hash(file) would actually by the Merkle root. However, to verify that a section belongs to the file I would need the entire Merkle tree (not just a single hash).
Any thoughts about proving that a file contains a specific data block? It doesn't matter which hashing methodology I use as long as I can verify it with little information.