3 ms·
Collision combined with length extension could be a neat way of attacking deduping. Basically first a prefix, then a collision block, then a suffix that is enc
by im3w1l 6y ago
Collision combined with length extension could be a neat way of attacking deduping.
Basically first a prefix, then a collision block, then a suffix that is encrypted with a key derived from one of the collision blocks.
If you can arrange for the deduper to find the document with the wrong key first, then it will skip over the super secret stuff.
- formerly_proven 6y agoFor deduplicated storage you really want A=B <=> H(A)=H(B) to hold for all data you are going to see, so accessible constructions for collisions should already bar an algorithm from this application.
- im3w1l 6y agoI 100% agree, but some people seem to go "eh it's not a problem in practice" for as long as they possibly can.