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(M 2), 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(log2 M). In the case when the fingerprinting code is allowed to be nonlinear, finding the best code amounts to finding the largest B 2-sequence of binary vectors, an old combinatorial problem. In that case decoding complexity is intermediate, namely O(M).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barg, A., Cohen, G., Encheva, S., Kabatiansky, G., Zémor, G.: A hypergraph approach to the identifying parent property. SIAM J. on Discrete Math. 14 (2001) 423–431
Boneh, D., Shaw, J.: Collusion-Secure Fingerprinting for Digital Data. IEEE Trans. Inf. Theory. IT-44 (1998) 1897–1905 (preliminary version in Crypto’95).
Cohen, G., Lempel, A.: Linear intersecting codes. Discrete Math. 56 (1985) 35–43
Cohen, G., Litsyn, S., Zémor, G.: Binary B 2-Sequences: a new upper bound. J. Combinatorial Theory, Series A. 94 (2001) 152–155
Cohen, G., Zémor, G.: Intersecting codes and independent families. IEEE Trans. Inf. Theory. IT-40 (1994) 1872–1881
Hollmann, H.D., van Lint, J.H., Linnartz, J.-P., Tolhuizen, L.M.: On codes with the identifiable parent property. J. Combinatorial Theory, Series A. 82 (1998) 121–133
Katona, G., Srivastava, J.: Minimal 2-coverings of a finite affine space based on GF(2). J. Stat. Planning and Inference. 8 (1983) 375–388
Lindström, B.: On B 2-Sequences of Vectors. J. of Number Theory. 4 (1972) 261–265
Miklós, D.: Linear binary codes with intersection properties. Discrete Appl. Math. 9 (1984) 187–196
McEliece, R. J., Rodemich, E. R., Rumsey, H. C. Welch, L. R.: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Trans. Inf. Theory. IT-23 (1977) 157–166
Sagalovitch, Yu. L.: Methods of introducing redundancy for raising the reliability of a finite automaton. Problems of Information Transmission. 4 (1968) 62–72
Sagalovitch, Yu. L.: Separating systems. Problems of Information Transmission. 30 (1994) 105–123
Sloane, N. J. A.: Covering arrays and intersecting codes. J. Combinator. Designs. 1 (1993) 51–63
Staddon, J. N., Stinson, D. R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory. IT-47 (2001) 1042–1049
Stinson, D.R., Tran Van Trung, Wei, R.: Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures. J. Stat. Planning and Inference. 86 (2000) 595–617
Stinson, D.R., Wei, R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discrete Math. 11 (1998) 41–53.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, G., Litsyn, S., Zémor, G. (2002). Binary Codes for Collusion-Secure Fingerprinting. In: Kim, K. (eds) Information Security and Cryptology — ICISC 2001. ICISC 2001. Lecture Notes in Computer Science, vol 2288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45861-1_14
Download citation
DOI: https://doi.org/10.1007/3-540-45861-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43319-4
Online ISBN: 978-3-540-45861-6
eBook Packages: Springer Book Archive