Paper 2009/633

Traitor-Tracing on Binary Strings

Michael J. Collins

Abstract

Codes with the \emph{Identifiable Parent Property} (IPP) have been studied in the context of traitor tracing; such codes can be used to enable a data supplier to determine the origin of pirated data. We consider an analogous property for a set of binary strings $S$: if a new string $\tau$ is formed by concatenating substrings of members of $S$, we should be able to identify at least one original string which must have been used to generate $\tau$. We prove upper and lower bounds for the size of sets which satisfy this property.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
Traitor TracingIdentifiable Parent PropertyStringsWatermarking
Contact author(s)
mjcolli @ sandia gov
History
2009-12-26: received
Short URL
https://ia.cr/2009/633
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/633,
      author = {Michael J.  Collins},
      title = {Traitor-Tracing on Binary Strings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/633},
      year = {2009},
      url = {https://eprint.iacr.org/2009/633}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.