This document discusses rekeying load in group key distributions that use cover-free families. It provides bounds on the number of messages needed to rekey a distribution after one or two users have been ejected simultaneously. For certain distributions based on symmetric combinatorial designs, the bounds shown are tight. In general, determining the minimal number of messages needed for rekeying a system based on a cover-free family is an NP-hard problem.