A universal set of hash functions is a set of hash functions such that randomly choosing any hash function from the set guarantees an upper bound on the number of collisions regardless of which keys from the universe are input to it (which are also random).
Basically it makes it more difficult for an adversary to exploit collisions from your hash function.
Basically it makes it more difficult for an adversary to exploit collisions from your hash function.