On the fingerprinting capacity under the marking assumption

IEEE Transactions on Information Theory

Volumn 54, Issue 6, 2008, Pages 2678-2689

  Anthapadmanabhan, N Prasanth ^a   Barg, Alexander ^a,b   Dumer, Ilya ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Channel capacity; Digital fingerprinting; Multipleaccess channel (MAC); Strong converse theorem

Indexed keywords

CODES (STANDARDS); CODES (SYMBOLS); PROGRAMMING THEORY;

CODE RATES; CODING THEOREMS; LOWER AND UPPER BOUNDS; LOWER BOUNDS; MULTIPLE ACCESS CHANNEL (MAC); NEW IDEAS; UPPER BOUNDS;

COMMUNICATION;

EID: 43949135930     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.921859     Document Type: Article

References (17)

1. R. Ahlswede, "An elementary proof of the strong converse theorem for the multiple-access channel," J. Combin., Inf. and Syst. Sci., vol. 7, no. 3, pp. 216-230, 1982.
2. R. Ahlswede and N. Cai, "Codes with the identifiable parent property and the multiple-access channel," in General Theory of Information Transfer (Lecture Notes in Computer Science), R. Ahlswede et al., Ed. Berlin, Germany: Springer-Verlag, 2006, vol. 4123, pp. 249-257.
3. N. Alon and U. Stav, "New bounds on parent-identifying codes: The case of multiple parents," Combin. Probab. Comput., vol. 13, no. 6, pp. 795-807, 2004.
4. N. P. Anthapadmanabhan and A. Barg, "Random binary fingerprinting codes for arbitrarily sized coalitions," in Proc. IEEE Int. Symp. Information Theory (ISIT 2006), Seattle, WA, Jul. 2006, pp. 351-355.
5. U. Augustin, "Gedächtnisfreie Kanäle für diskrete Zeit," Z. Wahrscheinlichkeitstheorie u. verw. Gebiete, vol. 6, pp. 10-61, 1966.
6. A. Barg, G. R. Blakley, and G. Kabatiansky, "Digital fingerprinting codes: Problem statements, constructions, identification of traitors," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 852-865, Apr. 2003.
7. A. Barg, G. Cohen, S. Encheva, G. Kabatiansky, and G. Zémor, "A hypergraph approach to the identifying parent property: The case of multiple parents," SIAM J. Discr. Math., vol. 14, no. 3, pp. 423-431, 2001.
8. S. R. Blackburn, "An upper bound on the size of a code with the κ-identifiable property," J. Combinat. Theory Ser. A, vol. 102, pp. 179-185, 2003.
9. G. R. Blakley and G. Kabatiansky, "Random coding technique for digital fingerprinting codes: Fighting two pirates revisited," in Proc. IEEE Int. Symp. Information Theory (ISIT 2004), Chicago, IL, Jun./Jul. 2004, pp. 203-203.
10. D. Boneh and J. Shaw, "Collusion-secure fingerprinting for digital data," IEEE Trans. Inf. Theory, vol. 44, no. 5, pp. 1897-1905, Sep. 1998.
11. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
12. H. D. L. Hollmann, J. H. van Lint, J.-P. Linnartz, and L. M. G. M. Tolhuizen, "On codes with the identifiable parent property," J. Combin. Theory Ser. A, vol. 82, pp. 121-133, 1998.
13. W. Feller, " An Introduction to Probability Theory and Its Applications. New York: Wiley, 1971, vol. II.
14. P. Moulin and J. A. O'Sullivan, "Information-theoretic analysis of information hiding," IEEE Trans. Inf. Theory, vol. 49, no. 3, pp. 563-593, Mar. 2003.
15. 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, Mar. 2005.
16. J. N. Staddon, D. R. Stinson, and R. Wei, "Combinatorial properties of frameproof and traceability codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 1042-1049, Mar. 2001.
17. G. Tardos, "Optimal probabilistic fingerprint codes," J. ACM, Preliminary version in Proc. 35th Annu. Symp. Theory of Computing (STOC 2003), pp. 116-125, 2003, to be published.