We present new lower bounds for the size of perfect and separating hash families ensuring their existence. Such new bounds are based on the algorithmic cluster expansion improved version of the Lovász local lemma, which also implies that the Moser–Tardos algorithm finds such hash families in polynomial time.