Score:0

Validating a partial message from a hash

vn flag

Let's say I have 3 items (A, B, C). Is there some sort of hash algorithm such that if I send (A, B, C) to another person, they can give me back the same hash and the same items or a subset of those items (for example (A, C)), and I can validate that they didn't give me extra/invalid items (for example (A, D))?

I apologize in advance for my lack of mathematical background.

Aman Grewal avatar
gb flag
Sounds like an XY problem. Can you give more context?
Ievgeni avatar
cn flag
Could you explain the problem with more clarity?
Maarten Bodewes avatar
in flag
Does a Merkle tree possibly do what you want? If you want to validate a subset then you need the entire tree of hashes. And if you want to have it order independent then you can simply order the elements prior to hashing.
SEJPM avatar
us flag
There do seem to be extra requirements missing as the current description seems to be solvable by associating a token with each element (e.g. its hash) and then checking that only previously known tokens are returned.
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.