I would like to know if there is a construction for a Rolling Hash function to be used to split the received untrusted data in chunks.

The data is split whenever the hash function drops below a certain threshold and the splitted data is then used to build trees for efficient indexing of such data. In my case the input data is however untrusted and I need a rolling hash construction that preserves the mean splitting size even under adversarial attacks on the data (which would otherwise make the trees highly unbalanced).

From what I have seen rolling hashes are mainly used in backup applications for deduplication purposes but they operate under the setting of non-adversary data. Thank you in advance.

  • $\begingroup$ Does your setting allow the hashing process to make use of a randomly chosen "tweak" value that the adversary cannot find out (at least until the whole data is hashed)? If yes, it seems to me that you have plenty of options using e.g. universal hashing; if not, things get trickier and, depending on other constraints, the problem might even be fundamentally unsolvable. $\endgroup$ Apr 23 at 14:46
  • 1
    $\begingroup$ @IlmariKaronen I actually don't have such luxury since the goal is to build a distrbuted system with open source code and where the way in which the tree is formed has to be the same for all participants, given the same data. $\endgroup$
    – trenta3
    Apr 23 at 17:47

There are absolutely functions like this but no such function, regardless of its properties, can solve your problem. They depend on the adversary not knowing the secret value used for deciding where to mark the stream. For efficient rolling HMACs, the attacker has almost full control of the output if they know the key.

how to build a secure rolling HMAC

Performance is 1/16th that of AES encryption because one full block is encrypted for every input byte. The universal hash is trivial in comparison and not a bottleneck.

An attacker with the key can produce streams with arbitrary function outputs limited by the number of bits they are putting into the window. Putting in 16 bytes gives them (almost) full control of the output of the universal function and resulting AES encrypted output value.

This is true regardless of the function you use. If the attacker has the keys they can set the splitting properties of the stream arbitrarily. It's only a question of computing cost.

That's why most systems for chunking or otherwise marking locations in streams as interesting just use buzhash and friends with a secret tweak. The moment the attacker learns that F(x)<threshold they can construct a stream x|x|x|x full of marked locations. Constructing a stream that contains no marks is similarly trivial. It becomes possible to construct streams with arbitrary marks from a library of strings with known mark properties.

There's no point in paying the computing cost to prevent key recovery if the adversary can break the system anyway which is why secure rolling hashes aren't in wider use.

  • $\begingroup$ Thank you very much for the detailed reply. Do you know if the existence of such functions is provably impossible? Or it is just something that is currently not available? Moreover, would you suggest another method (not a rolling hash) to solve the original problem of content-defined chunking under adversarial data (crypto.stackexchange.com/q/89595/89715 for a more targeted question) irregardless of the efficiency? $\endgroup$
    – trenta3
    Apr 26 at 12:48

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.