Binary Codes for Collusion-Secure Fingerprinting

Authors:
Gérard D. Cohen;Simon Litsyn;Gilles Zémor
Affiliations:
-;-;-
Venue:
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Year:
2001

Citing 6
Cited 3

Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

SIAM Journal on Discrete Mathematics
On codes with the identifiable parent property

Journal of Combinatorial Theory Series A
Binary B2-sequences: a new upper bound

Journal of Combinatorial Theory Series A
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents

SIAM Journal on Discrete Mathematics
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory

Improved tracing algorithm for random-error-resilient collusion-secure fingerprinting codes in P2P information systems

InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
An Efficient Anonymous Fingerprinting Protocol

Computational Intelligence and Security
Key management for multicast fingerprinting

ICISS'05 Proceedings of the First international conference on Information Systems Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the problem of Collusion-Secure Fingerprinting in the case when marks are binary and coalitions are of size 2. We are motivated by two considerations, the pirates' probablity of success (which must be non-zero, as was shown by Boneh and Shaw) on one hand, and decoding complexity on the other. We show how to minimize the pirates' probability of success: but the associated decoding complexity is O(M2), where M is the number of users. Next we analyze the Boneh and Shaw replication strategy which features a higher probability of success for the pirates but a lower decoding complexity. There are two variations. In the case when the fingerprinting code is linear we show that the best codes are linear intersecting codes and that the decoding complexity drops to O(log2M). In the case when the fingerprinting code is allowed to be nonlinear, finding the best code amounts to finding the largest B2-sequence of binary vectors, an old combinatorial problem. In that case decoding complexity is intermediate, namely O(M).