Reputation
Top tag
Next privilege 150 Rep.
Create new tags
Badges
5
Impact
~328 people reached

  • 0 posts edited
  • 0 helpful flags
  • 1 vote cast
Feb
10
comment Needed: signature over a collection of hashes
thanks. I did an analysis of Bloom filters for this purpose several years ago and we were not happy with the results. Against even a modest adversary, it is possible to produce hash values that alias to valid hashes in the Bloom. That is, it is possible to create false positives more-or-less at will.
Feb
9
comment Needed: signature over a collection of hashes
I'm aware of Merkle Trees. They require that each hash be distributed with additional material that it can use to perform the proof. It's close to what I want and I thought about using them, but they're not quite what I want.
Dec
18
comment Did Merkle invent cryptographic hashing?
I can't find the Rabin 78 paper online. The Rabin 79 MIT/LCS/TR-212 does not have iterated hash functions. It's true that hash functions were well known in 1978 as were one-way functions, but I haven't found one-way hash functions before Merkle's thesis.