Expurgated Gaussian fingerprinting codes

Pierre Moulin; Negar Kiyavash

doi:10.1109/ISIT.2007.4557308

Expurgated Gaussian fingerprinting codes

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages	711-715
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2007.4557308
State	Published - 2007
Event	2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France Duration: Jun 24 2007 → Jun 29 2007

Publication series

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

Other

Other	2007 IEEE International Symposium on Information Theory, ISIT 2007
Country	France
City	Nice
Period	6/24/07 → 6/29/07

Keywords

Digital fingerprinting
Large deviations
Random codes

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2007.4557308

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

Cite this

Moulin, P & Kiyavash, N 2007, Expurgated Gaussian fingerprinting codes. in Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007., 4557308, IEEE International Symposium on Information Theory - Proceedings, pp. 711-715, 2007 IEEE International Symposium on Information Theory, ISIT 2007, Nice, France, 6/24/07. https://doi.org/10.1109/ISIT.2007.4557308

@inproceedings{6f2a8a25b8f14c909e79de4210c5002e,

title = "Expurgated Gaussian fingerprinting codes",

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.",

keywords = "Digital fingerprinting, Large deviations, Random codes",

author = "Pierre Moulin and Negar Kiyavash",

year = "2007",

doi = "10.1109/ISIT.2007.4557308",

language = "English (US)",

isbn = "1424414296",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "711--715",

booktitle = "Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007",

}

TY - GEN

T1 - Expurgated Gaussian fingerprinting codes

AU - Moulin, Pierre

AU - Kiyavash, Negar

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Digital fingerprinting

KW - Large deviations

KW - Random codes

UR - http://www.scopus.com/inward/record.url?scp=51649122753&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51649122753&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2007.4557308

DO - 10.1109/ISIT.2007.4557308

M3 - Conference contribution

AN - SCOPUS:51649122753

SN - 1424414296

SN - 9781424414291

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 711

EP - 715

BT - Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007

T2 - 2007 IEEE International Symposium on Information Theory, ISIT 2007

Y2 - 24 June 2007 through 29 June 2007

ER -