A tight bound for frameproof codes viewed in terms of separating hash families
Frameproof codes have been introduced for use in digital fingerprinting that prevent a coalition of \(w\) or fewer legitimate users from constructing a fingerprint of another user not in the coalition. It turns out that \(w\)-frameproof codes are equivalent to separating hash families of type \(\{1,w\}\). In this paper we prove a tight bound for frameproof codes in terms of separating hash families.
tight bound frameproof code separating hash family 68r05