A Higher Order Analysis of the Joint Capacity of Digital Fingerprinting Codes against the Interleaving Attack

ABSTRACT

Digital fingerprinting codes are embedded to licenced digital contents for preventing illegal distribution by colluders. Digital fingerprinting codes are usually required to have the ability to specify a part (or all) of the colluders with high probability who generate a pirated copy. In this paper we evaluate the joint capacity C(_PINT) of the digital fingerprinting code against the interleaving attack by c colluders. Quite recently, Laarhoven shows that C(_PINT) = 1.1604/(2c² ln 2) for sufficiently large c. However, this formula includes numerical optimization and is not a good approximation of the capacity C(_PINT) for small values of c. In this paper we obtain two series that yield various upper and lower bounds of C(_PINT), respectively, which give fairly well approximation of C(_PINT) for a wide range of c. The upper and the lower bounds are obtained by using the Taylor expansion indicated by Furon and Pérez-Freire [8] together with the analysis of the l-th moments of a binomial distribution around its mean for l≥2. In particular, the lower bounds give approximation of c²C(_PINT) for various ranges of c.

References

1. D. Boneh and J. Shaw, "Collusion-secure fingerprinting for digital data," IEEE Trans. Inf. Theory, vol. 44, no. 5, pp. 1897--1905, 1998.
2. A. Barg, G. R. Blakley and G. Kabatiansky,"Collusion-secure fingerprinting for digital data," IEEE Trans. Inf. Theory, vol 49, no. 4, pp. 852--865, 2003.
3. G. R. Blakly and G. Kabatiansky, "Random coding technique for digital fingerprinting codes:fighting two pirates revisited," Proc. 2004 IEEE ISIT, Chicago, p. 202, 2004.
4. A. Somekh-Baruch and N. Merhav, "On the capacity game of private fingerprinting systems under collusion attacks," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 884--899, 2005.
5. G. Tardos, "Optimal probabilistic fingerprint code," J. ACM, vol. 55, no. 2, Article 10, 2008.
6. N. P. Anthapadmanabhan, A. Barg and I. Dumer, "On the fingerprinting under the marking assumption," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2678--2689, 2008.
7. P. Moulin, "Universal fingerprinting: capacity and random-coding exponents," Proc. 2008 IEEE ISIT, Tronto, Canada, pp. 220--224, 2008. (Full version is available as arXiv:0801.3837v3 {cs.IT})
8. T. Furon and L. Pérez-Freire, "Worst case attacks against binary probabilistic traitor tracing codes," IEEE Int. Workshop on Information Forensics and Security, Dec. 2009. (Full version is available as arXiv:0903.3480v2 {cs.IT} )
9. H. Koga, "On the capacity of the AND anti-collusion fingerprinting codes," IEICE Technical Report, IT2009-140, 2010.
10. D. Boesten and B. Skoric, "Asymptotic fingerprinting capacity for non-binary alphabets," Proc. 13th Information Hiding Conference (IH2011), LNCS 6958, pp. 1--13, Springer, 2011.
11. Y. W. Huang and P. Moulin, "On the saddle-point solution and the large-collusion asymptotics of fingerprinting games," IEEE Trans. Information Forensics and Security, vol. 7, no. 1, pp. 160--175, 2012.
12. Y. W. Huang and P. Moulin, "n the fingerprinting capacity games for arbitrary alphabets and their asymptotics," IEEE Trans. Information Forensics and Security, vol. 9, no. 9, pp. 1477--1490, 2014.
13. T. Laarhoven,"Capacities and capacity-achieving decoders for various fingerprinting games," Proc. 2nd ACM Workshop on IH & MMSec, pp. 123--134, 2014.
14. T. Laarhoven,"Asymptotics of fingerprinting and group testing: tight bounds from channel capacities," IEEE Trans. Information Forensics and Security, vol. 10, no. 9, pp. 1967--1970, 2015.
15. G. G. Lorentz,textitBernstein Polynomials (Second Edition), Chelsea Publishing Company, 1986.

Index Terms

• Computer systems organization

  • Dependable and fault-tolerant systems and networks

    • Redundancy

  • Embedded and cyber-physical systems

    • Embedded systems

    • Robotics