Coverings, centered codes, and combinatorial steganography
Problems of Information Transmission
Performance of orthogonal fingerprinting codes under worst-case noise
IEEE Transactions on Information Forensics and Security
Fingerprinting compressed multimedia signals
IEEE Transactions on Information Forensics and Security
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Variations on information embedding in multiple access and broadcast channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Forensics and Security
Asymptotically false-positive-maximizing attack on non-binary tardos codes
IH'11 Proceedings of the 13th international conference on Information hiding
Accusation probabilities in Tardos codes: beyond the Gaussian approximation
Designs, Codes and Cryptography
| Hi-index | 754.90 |
The problem of fingerprinting in the presence of collusive attacks is considered. It is modeled as a game between a fingerprinter and a decoder on the one hand, and a coalition of two or more attackers on the other. The fingerprinter distributes, to different users, different fingerprinted copies of a host data (covertext ) embedded with different fingerprints. The coalition members create a forgery of the data while aiming at erasing the fingerprints in order not to be detected. Their action is modeled by a multiple-access channel (MAC). The decoder, who has access to the original covertext data, observes the forgery and decodes one of the messages in order to identify one of the members of the coalition. Motivated by a worst case approach, we assume that the coalition of attackers is informed of the hiding strategy taken by the fingerprinter and the decoder, while they are uninformed of the attacking scheme. A single-letter expression for the capacity is derived under the assumption that the host data is drawn from a memoryless stationary source and some mild assumptions on the operation of the encoder. It is shown that for a coalition consisting of L