Expurgated Gaussian fingerprinting codes

Pierre Moulin, Negar Kiyavash

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper analyzes the performance of collusion attacks on random fingerprinting codes, when the colluders are subject to an almost-sure squared distortion constraint and a list decoder is used. We derive an exact characterization of the type-I and type-II error exponents of the fingerprinting system. A Gaussian ensemble and an expurgated Gaussian ensemble of codes are considered, and the corresponding random-coding exponents are derived. Explicit optimal strategies for the colluders are derived as well.

Original languageEnglish (US)
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages711-715
Number of pages5
DOIs
StatePublished - 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: Jun 24 2007Jun 29 2007

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2007 IEEE International Symposium on Information Theory, ISIT 2007
CountryFrance
CityNice
Period6/24/076/29/07

Keywords

  • Digital fingerprinting
  • Large deviations
  • Random codes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Expurgated Gaussian fingerprinting codes'. Together they form a unique fingerprint.

Cite this