Digital fingerprinting codes: problem statements, constructions, identification of traitors

DOI10.1109/TIT.2003.809570zbMath1063.94079MaRDI 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

Mathematics Subject Classification ID

94A62: Authentication, digital signatures and secret sharing

Related Items

Equal-Weight Fingerprinting Codes, 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, Cover-free codes and separating system codes, Codes with the identifiable parent property for multimedia fingerprinting, Sequential Monte Carlo for rare event estimation, Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing, Constructions of almost secure frameproof codes with applications to fingerprinting schemes, Bounds on the rate of separating codes, A class of I.P.P. codes with efficient identification, Traceability codes, Separable collusion-secure multimedia codes, Multimedia IPP codes with efficient tracing, Generalization of IPP codes and IPP set systems, Traceability codes and their generalizations, Wide-sense 2-frameproof codes, Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise, On generalized separating hash families, Optimal 2-traceability codes of length 4