scientific article; zbMATH DE number 1759652

MaRDI QIDQ4536648zbMATH OpenFDO

Authors Gilles Zémor, Gérard Cohen, Simon Litsyn

Publication date 23 November 2002

zbMATH Keywords

\(B_2\)-sequencecollusion resistantdecoding complexityfingerprintingintersectinglinear intersecting codeswatermaking

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Authentication, digital signatures and secret sharing (94A62) Combinatorial codes (94B25) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 2079373
• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
• Obtaining Asymptotic Fingerprint Codes Through a New Analysis of the Boneh-Shaw Codes
• Optimal probabilistic fingerprint codes
• Digital fingerprinting codes: problem statements, constructions, identification of traitors

Cited in

(10)

• Binary fingerprinting codes
• scientific article; zbMATH DE number 1617940 (Why is no real title available?)
• Digital fingerprinting under and (somewhat) beyond the marking assumption. (Invited talk)
• scientific article; zbMATH DE number 1982617 (Why is no real title available?)
• scientific article; zbMATH DE number 2079373 (Why is no real title available?)
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• scientific article; zbMATH DE number 2087911 (Why is no real title available?)
• An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths
• scientific article; zbMATH DE number 5059862 (Why is no real title available?)
• Cryptographic methods for collusion-secure fingerprinting of digital data

This page was built for publication:

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