Soft-Decision Tracing in Fingerprinted Multimedia Content
IEEE MultiMedia
Content adaptive watermarking for multimedia fingerprinting
Computer Standards & Interfaces
On-off keying modulation and tardos fingerprinting
Proceedings of the 10th ACM workshop on Multimedia and security
Improving the Boneh-Franklin Traitor Tracing Scheme
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
High-rate random-like spherical fingerprinting codes with linear decoding complexity
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
A note about the traceability properties of linear codes
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Fingerprinting schemes. identifying the guilty sources using side information
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
Near-Optimal collusion-secure fingerprinting codes for efficiently tracing illegal re-distribution
CSS'12 Proceedings of the 4th international conference on Cyberspace Safety and Security
| Hi-index | 754.84 |
We apply results from algebraic coding theory to solve problems in cryptography, by using recent results on list decoding of error-correcting codes to efficiently find traitors who collude to create pirates. We produce schemes for which the traceability (TA) traitor tracing algorithm is very fast. We compare the TA and identifiable parent property (IPP) traitor tracing algorithms, and give evidence that when using an algebraic structure, the ability to trace traitors with the IPP algorithm implies the ability to trace with the TA algorithm. We also demonstrate that list decoding techniques can be used to find all possible pirate coalitions. Finally, we raise some related open questions about linear codes, and suggest uses for other decoding techniques in the presence of additional information about traitor behavior.