Gábor Tardos
ABSTRACT
We construct binary codes for fingerprinting. Our codes for n users that are ε-secure against c pirates have length O(c2 log(n/ε)). This improves the codes proposed by Boneh and Shaw [3] whose length is approximately the square of this length. Our codes are probabilistic. By proving matching lower bounds we establish that the length of these codes is best within a constant factor for reasonable error probabilities. This lower bound generalizes the bound found independently by Peikert, Shelat, and Smith [10] that applies to a limited class of codes. Our results also imply that randomized fingerprint codes over a binary alphabet are as powerful as over an arbitrary alphabet, and also the equal strength of two distinct models for fingerprinting.
- G. R. Blakley, C. Meadows and G. B. Purdy, Fingerprinting long forgiving messages, Proc. of Crypto '85 Springer-Verlag Berlin, Heidelberg, 1985, pp. 180--189.]] Google Scholar
Digital Library
- D. Boneh and M. Franklin, An efficient public key traitor tracing scheme, Proc. of Crypto '99 Springer-Verlag, Berlin, Heidelberg, 1999, pp. 338--353.]] Google ScholarDigital Library
- D. Boneh and J. Shaw, Collusion-secure fingerprinting for digital data, IEEE Transactions of Information Theory 44 (1998), 480--491.]]Google ScholarDigital Library
- F. Chung, R. Graham, T. Leighton, Guessing secrets, Electronic Journal of Combinatorics 8 (1), 2001.]]Google Scholar
- B. Chor, A. Fiat and M. Naor, Tracing traitors, Proc. of Crypto'94 LNCS 839, Springer-Verlag Berlin, Heidelberg, 1994, pp. 257--270.]] Google ScholarDigital Library
- J. Guth and B. Pfitzmann, Error- and collusion-secure fingerprinting for digital data, Information Hiding (IH '99) LNCS 1768, Springer-Verlag, Berlin 2000, pp. 134--145.]] Google ScholarDigital Library
- J. Kilian, T. Leighton, L. Matheson, T. Shamoon, R. Tarjan, F. Zane, Resistance of digital watermarks to collusive attacks, in: Proceedings of 1998 IEEE International Symposium on Information Theory.]]Google Scholar
- K. Kurosawa and Y. Desmedt, Optimum traitor tracing and asymmetric schemes, Advances in cryptology---EUROCRYPT'98 LNCS 1403, Springer, Berlin, 1998, pp. 145--157.]]Google Scholar
- T. Lindkvist, Fingerprinting digital documents, Linköping Studies in Science and Technology, Thesis No. 798, 1999.]]Google Scholar
- C. Peikert, A. Shelat, A. Smith, Lower bounds for collusion-secure fingerprinting, in: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2003.]] Google ScholarDigital Library
- A. Rényi, Probability theory, North-Holland Series in Applied Mathematics and Mechanics, Vol. 10. North-Holland Publishing Co., Amsterdam, London; American Elsevier Publishing Co., Inc., New York, 1970.]]Google Scholar
- R. Safavi-Naini and Y. Wang, Sequential traitor tracing, Proc. of Crypto'2000, LNCS 1880, Springer-Verlag Berlin, Heidelberg, 2000, pp.316--332.]] Google ScholarDigital Library
- J. N. Staddon, D. R. Stinson, R. Wei, Combinatorial properties of frameproof and traceability codes, IEEE Transactions of Information Theory 47 (2001), 1042--1049.]]Google ScholarDigital Library
- N. Wagner, Fingerprinting, Proc. of the 1983 IEEE Symposium on Security and Privacy (1983), pp. 18--22.]] Google ScholarDigital Library
Index Terms
- Optimal probabilistic fingerprint codes
Recommendations
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting digital documents. Our codes for n users that are ϵ-secure against c pirates have length O(c2log(n/ϵ)). This improves the codes proposed by Boneh and Shaw [1998] whose length is approximately the square of ...
An improvement of discrete Tardos fingerprinting codes
It has been proven that the code lengths of Tardos's collusion-secure fingerprinting codes are of theoretically minimal order with respect to the number of adversarial users (pirates). However, the code lengths can be further reduced as some preceding ...
Latent Fingerprint Matching
Latent fingerprint identification is of critical importance to law enforcement agencies in identifying suspects: Latent fingerprints are inadvertent impressions left by fingers on surfaces of objects. While tremendous progress has been made in plain and ...
Comments