Sequential and dynamic frameproof codes (Q2384002)

There are many methods whose goals are to protect digital data from piracy by digital fingerprinting. Split the data into \(l\) segments where each can be marked in \(q\) ways, then each copy of the data corresponds to a word \(x\in Q^l\) and the set of words corresponding to marked copies forms a code \(C\subseteq Q^l\). The set of descendants of \(S\subseteq Q^l\), \(\text{desc}(S)\), consists of all words that agree in each coordinate position with some word in \(S\). A code \(C\subseteq Q^l\) is a \(c\)-frameproof code if every \(S\subseteq C\) such that \(|S|\leq c\) has \(\text{desc}(S)\cap C= S\), and so no set of \(c\) or fewer pirates can collude to frame a user outside of that set. The author extends the properties of frameproof codes to the dynamic broadcast setting, defining and investigating \(l\)-sequential \(c\)-frameproof codes and \(l\)-dynamic \(c\)-frameproof codes. Bounds on the numbers of users supported by these methods are also provided.