A polynomial lower bound for the size of any $k$-min-wise independent set of permutations

The notion of $k$-min-wise independent set of permutations, which was introduced by A. Broder et al., is considered. A nontrivial polynomial lower bound for the smallest size of such sets is obtained.