Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise with Optimal Rate
Ilya Vorobyev

TL;DR
This paper advances multimedia fingerprinting codes that are fully traceable and resistant to averaging attacks and noise, providing improved rate bounds to enhance digital content protection.
Contribution
It offers an improved lower bound on the rate of complete traceability multimedia fingerprinting codes under adversarial noise.
Findings
Established a new lower bound on code rate
Enhanced resistance of codes to averaging attacks and noise
Extended previous constructions with improved theoretical guarantees
Abstract
In this paper we consider complete traceability multimedia fingerprinting codes resistant to averaging attacks and adversarial noise. Recently it was shown that there are no such codes for the case of an arbitrary linear attack. However, for the case of averaging attacks complete traceability multimedia fingerprinting codes of exponential cardinality resistant to constant adversarial noise were constructed in 2020 by Egorova et al. We continue this work and provide an improved lower bound on the rate of these codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Steganography and Watermarking Techniques
