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

DOI10.1109/TIT.2003.809570MaRDI QIDQ4680056zbMATH OpenOpenAlexFDO

Authors Alexander Barg, G. R. Blakley, 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

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Information Security Practice and Experience
• scientific article; zbMATH DE number 1955790
• scientific article; zbMATH DE number 2042811
• scientific article; zbMATH DE number 1941260
• scientific article; zbMATH DE number 1759652
• Short \(c\)-secure fingerprinting codes
• Constructions of almost secure frameproof codes with applications to fingerprinting schemes
• scientific article; zbMATH DE number 2080172

Cited in

(31)

• 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
• Digital fingerprinting under and (somewhat) beyond the marking assumption. (Invited talk)
• 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
• Achievable Error Exponents for the Private Fingerprinting Game
• On the Fingerprinting Capacity Under the Marking Assumption
• scientific article; zbMATH DE number 1941260 (Why is no real title available?)
• scientific article; zbMATH DE number 1955790 (Why is no real title available?)
• scientific article; zbMATH DE number 1759652 (Why is no real title available?)
• Cover-free codes and separating system codes
• Codes with the identifiable parent property for multimedia fingerprinting
• Equal-Weight Fingerprinting Codes
• 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
• Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)
• Combinatorial constructions of separating codes
• Sequential Monte Carlo for rare event estimation
• New upper bounds for wide-sense frameproof codes

This page was built for publication: Digital fingerprinting codes: problem statements, constructions, identification of traitors

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