Fingerprinting long forgiving messages
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Asymmetric fingerprinting for larger collusions
Proceedings of the 4th ACM conference on Computer and communications security
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Improved Boneh-Shaw Content Fingerprinting
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Collusion secure convolutional fingerprinting information codes
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Designs, Codes and Cryptography
Optimal probabilistic fingerprint codes
Journal of the ACM (JACM)
Combining Tardos fingerprinting codes and fingercasting
IH'07 Proceedings of the 9th international conference on Information hiding
Robust fingerprinting codes: a near optimal construction
Proceedings of the tenth annual ACM workshop on Digital rights management
A family of asymptotically good binary fingerprinting codes
IEEE Transactions on Information Theory
Optimization and evaluation of randomized c-secure CRT code defined on polynomial ring
IH'04 Proceedings of the 6th international conference on Information Hiding
Worst-case optimal fingerprinting codes for non-threshold collusion
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
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 | 0.06 |
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes and present an explicit construction. Their code has length O(c3 log(l/ε)) and attains security against coalitions of size c with ε error. Boneh and Shaw also present a lower bound of Ω (c3log(1/cε)) on the length of any collusion-secure code.We give new lower bounds on the length of collusion-secure codes by analyzing a weighted coinflipping strategy for the coalition. As an illustration of our methods, we give a simple proof that the Boneh-Shaw construction cannot be asymptotically improved. Next, we prove a general lower bound: no secure code can have length O(c21og(1/cε)), which improves the previous known bound by a factor of c. In particular, we show that any secure code will have length Ω(c2 log(1/cε)) as long as log(l/ε) ≥ K k log c, where K is a constant and k is the number of columns in the code (in some sense, a measure of the code's complexity). Finally, we describe a general paradigm for constructing fingerprinting codes which encompasses the construction of [3], and show that no secure code that follows this paradigm can have length O((c3/log c) log(1/cε)) follows this (again, by showing a lower bound for large values of ln(1/ε)). This suggests that any attempts at improvement should be directed toward techniques that lie outside our paradigm.