Digital fingerprinting under and (Somewhat) beyond the marking assumption(Invited Talk)

Alexander Barg, Grigory Kabatiansky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

This paper is an extended abstract of the invited talk given by the first-named author. In the first part of the talk we give a general introduction to collusion-resistant fingerprinting, discussing problem statements and different sets of assumptions for the digital fingerprinting problem. In the second part we discuss in more detail a combinatorial version of the fingerprinting problem, known as parent-identifying codes. Most earlier works on digital fingerprinting rely on the so-called marking assumption, under which the attackers cannot modify the coordinates in which their fingerprints are identical. We introduce a version of parent-identifying codes for collusion attacks that do not necessarily follow the marking assumption. We show existence of such codes for coalitions of arbitrary size t. Some exact answers are obtained for t=2 pirates.

Original languageEnglish
Title of host publicationInformation Theoretic Security - 5th International Conference, ICITS 2011, Proceedings
Pages202-205
Number of pages4
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event5th International Conference on Information Theoretic Security, ICITS 2011 - Amsterdam, Netherlands
Duration: 21 May 201124 May 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6673 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Information Theoretic Security, ICITS 2011
Country/TerritoryNetherlands
CityAmsterdam
Period21/05/1124/05/11

Fingerprint

Dive into the research topics of 'Digital fingerprinting under and (Somewhat) beyond the marking assumption(Invited Talk)'. Together they form a unique fingerprint.

Cite this