Score:0

Storing data in a Merkle tree

it flag

I had the idea of storing large amounts of data in a small space using a Merkle tree. But from what I understand about Merkle trees is you cannot extract the data from the Merkle root (since hashes are not reversible). Though I wonder, is there a way to use an encryption algorithm that gives a fixed output length like how we use hashes in Merkle trees? I know my question is hard to understand but looking at this diagram may give you a better idea of what I am trying to do here:Merkle tree

Score:2
my flag

If I understand you right, you are asking if there was a way to take the $n$-bit Merkle tree root, and use it to extract the multiple files that are the leaves.

Obviously, if the information within the files is more than $n$ bits, you can't - if there are $2^n$ possible roots, then no procedure can extract more than $2^n$ different values from it, and it doesn't matter what function you use as the "hash"

Apollo 11 avatar
it flag
Thank you for your answer. I am a newbie to cryptography. So can you explain what you mean by “n-bit”?
poncho avatar
my flag
@Apollo11: the root of the Merkle tree will be some value, and we usually represent that value as a serial of bits (or bytes, where each byte consists of 8 bits - in crypto, we more often count bits rather than bytes). By $n$-bit tree root, we mean that $n$ bits are used.
Apollo 11 avatar
it flag
Thank you for your explanation. I understand now.
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.