Robust parent-identifying codes

Alexander Barg, G. Robert Blakley, Grigory Kabatiansky, Cedric Tavernier

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

2 Citations (Scopus)

Abstract

Codes with the identifiable parent property (IPP codes) are used in traitor tracing schemes that protect data broadcast by the publisher from unauthorized access or distribution. An n-word y over a finite alphabet is called a descendant of a set of t words x1,.., xt if y iε {x1i,.., xti} for all i= 1, n. A code C={x1,..., xM} is said to have the i-IPP property if for any n-word y that is a descendant of at most t parents belonging to the code it is possible to identify at least one of them. The existence of good i-IPP codes is known from earlier works. We introduce a robust version of IPP codes which allows unconditional identification of parents even if some of the coordinates in y can break away from the descent rule, i.e., can take arbitrary values from the alphabet, or become completely unreadable. By linking this problem to perfect hash functions and, more generally, to hash distances of a code, we prove initial results on the proportion of such coordinates that can be tolerated under the unconditional recovery requirement.

Original languageEnglish
Title of host publication2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event2010 IEEE Information Theory Workshop, ITW 2010 - Dublin, Ireland
Duration: 30 Aug 20103 Sep 2010

Publication series

Name2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

Conference

Conference2010 IEEE Information Theory Workshop, ITW 2010
Country/TerritoryIreland
CityDublin
Period30/08/103/09/10

Fingerprint

Dive into the research topics of 'Robust parent-identifying codes'. Together they form a unique fingerprint.

Cite this