Sliding-window dynamic frameproof codes

DOI10.1007/S10623-006-9030-9MaRDI QIDQ2383995zbMATH OpenOpenAlexFDO

Publication date 20 September 2007

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://eprints.bbk.ac.uk/id/eprint/5366/1/5366.pdf

Other designs, configurations (05B30) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Review text

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 defines sliding window 1-dynamic frameproof codes and provides optimal constructions for a certain class. Bounds on the number of users are discussed and related open problems are considered.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Sliding-window dynamic frameproof codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383995)