Which randomized hashing technique ensures that for any two distinct keys, the probability of a collision is at most 1/m, where m is the number of slots?

Universal hashing

Universal hashing involves choosing a hash function at random from a carefully designed family of functions. This randomization prevents an adversary from specifically choosing keys that result in worst-case collisions.