I can think of hash functions that are homomorphic, but are not secure. A simple example is something like “sha256 each element separately and XOR all the resulting hashes together.” This would not be collusion resistant.
We offer a proof that LtHash with our choice of parameters provides over 200 bits of security. You would have to read the paper for the details.
We offer a proof that LtHash with our choice of parameters provides over 200 bits of security. You would have to read the paper for the details.