Achievable Error Exponents for the Private Fingerprinting Game

DOI10.1109/TIT.2007.894632MaRDI QIDQ3548284zbMATH OpenOpenAlexFDO

Authors Anelia Somekh-Baruch, Neri Merhav

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2007.894632

zbMATH Keywords

coding with side informationerror exponentsfingerprintinginformation hidingprivate watermarkingrandomized codesteganographyuniversal decodingwatermarking

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks
• On the Fingerprinting Capacity Under the Marking Assumption
• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Tardos Fingerprinting is Better Than We Thought

Cited in

(2)

• On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks
• On the Fingerprinting Capacity Under the Marking Assumption

This page was built for publication: Achievable Error Exponents for the Private Fingerprinting Game

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