Digital fingerprinting codes: problem statements, constructions, identification of traitors
From MaRDI portal
Publication:4680056
DOI10.1109/TIT.2003.809570zbMath1063.94079OpenAlexW2130460454MaRDI QIDQ4680056
G. R. Blakley, Alexander Barg, Grigory Kabatiansky
Publication date: 1 June 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.809570
Related Items
Almost separating and almost secure frameproof codes over \(q\)-ary alphabets, Analysis of properties of \(q\)-ary Reed-Muller error-correcting codes viewed as codes for copyright protection, A simple fingerprinting scheme for large user groups, Equal-Weight Fingerprinting Codes, Multimedia IPP codes with efficient tracing, Generalization of IPP codes and IPP set systems, Traceability codes and their generalizations, Improved upper bounds for the rate of separating and completely separating codes, Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory, Optimal 2-traceability codes of length 4, Wide-sense 2-frameproof codes, Traceability codes, Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing, Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise, Constructions of almost secure frameproof codes with applications to fingerprinting schemes, On generalized separating hash families, Cover-free codes and separating system codes, Codes with the identifiable parent property for multimedia fingerprinting, Bounds on the rate of separating codes, Sequential Monte Carlo for rare event estimation, Separable collusion-secure multimedia codes, A class of I.P.P. codes with efficient identification
