Universal fingerprinting: Capacity and random-coding exponents

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

Abstract

Bounds on fingerprinting capacity have been derived in recent literature. In this paper we present an exact capacity formula and a universal fingerprinting scheme. Our problem setup unifies the signaldistortion and Boneh-Shaw formulations of fingerprinting. The proposed scheme has four useful properties: (1) the receiver does not need to know the coalition size and collusion channel; (2) a tunable parameter Δ trades off false-positive and false-negative error exponents; (3) the receiver provides a reliability metric for its decision; and (4) the decoder is capacity-achieving when the false-positive exponent Δ tends to zero. The new random coding scheme uses a "time-sharing" randomized sequence and produces conditionally constant-composition fingerprints. The decoder is a minimum penalized equivocation decoder, where the penalty term is proportional to coalition size.

Original languageEnglish (US)
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages220-224
Number of pages5
DOIs
StatePublished - Sep 29 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: Jul 6 2008Jul 11 2008

Publication series

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

Other

Other2008 IEEE International Symposium on Information Theory, ISIT 2008
CountryCanada
CityToronto, ON
Period7/6/087/11/08

Fingerprint

Fingerprinting
Coding
Exponent
Coalitions
False Positive
Receiver
Chemical analysis
Error Exponent
Collusion
Fingerprint
Penalty
Sharing
Trade-offs
Directly proportional
Tend
Metric
Formulation
Zero
Term

ASJC Scopus subject areas

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

Cite this

Moulin, P. (2008). Universal fingerprinting: Capacity and random-coding exponents. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008 (pp. 220-224). [4594980] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2008.4594980

Universal fingerprinting : Capacity and random-coding exponents. / Moulin, Pierre.

Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. p. 220-224 4594980 (IEEE International Symposium on Information Theory - Proceedings).

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

Moulin, P 2008, Universal fingerprinting: Capacity and random-coding exponents. in Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008., 4594980, IEEE International Symposium on Information Theory - Proceedings, pp. 220-224, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 7/6/08. https://doi.org/10.1109/ISIT.2008.4594980
Moulin P. Universal fingerprinting: Capacity and random-coding exponents. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. p. 220-224. 4594980. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2008.4594980
Moulin, Pierre. / Universal fingerprinting : Capacity and random-coding exponents. Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. pp. 220-224 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{ae3760af0e90461a99920317431d80d0,
title = "Universal fingerprinting: Capacity and random-coding exponents",
abstract = "Bounds on fingerprinting capacity have been derived in recent literature. In this paper we present an exact capacity formula and a universal fingerprinting scheme. Our problem setup unifies the signaldistortion and Boneh-Shaw formulations of fingerprinting. The proposed scheme has four useful properties: (1) the receiver does not need to know the coalition size and collusion channel; (2) a tunable parameter Δ trades off false-positive and false-negative error exponents; (3) the receiver provides a reliability metric for its decision; and (4) the decoder is capacity-achieving when the false-positive exponent Δ tends to zero. The new random coding scheme uses a {"}time-sharing{"} randomized sequence and produces conditionally constant-composition fingerprints. The decoder is a minimum penalized equivocation decoder, where the penalty term is proportional to coalition size.",
author = "Pierre Moulin",
year = "2008",
month = "9",
day = "29",
doi = "10.1109/ISIT.2008.4594980",
language = "English (US)",
isbn = "9781424422579",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "220--224",
booktitle = "Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008",

}

TY - GEN

T1 - Universal fingerprinting

T2 - Capacity and random-coding exponents

AU - Moulin, Pierre

PY - 2008/9/29

Y1 - 2008/9/29

N2 - Bounds on fingerprinting capacity have been derived in recent literature. In this paper we present an exact capacity formula and a universal fingerprinting scheme. Our problem setup unifies the signaldistortion and Boneh-Shaw formulations of fingerprinting. The proposed scheme has four useful properties: (1) the receiver does not need to know the coalition size and collusion channel; (2) a tunable parameter Δ trades off false-positive and false-negative error exponents; (3) the receiver provides a reliability metric for its decision; and (4) the decoder is capacity-achieving when the false-positive exponent Δ tends to zero. The new random coding scheme uses a "time-sharing" randomized sequence and produces conditionally constant-composition fingerprints. The decoder is a minimum penalized equivocation decoder, where the penalty term is proportional to coalition size.

AB - Bounds on fingerprinting capacity have been derived in recent literature. In this paper we present an exact capacity formula and a universal fingerprinting scheme. Our problem setup unifies the signaldistortion and Boneh-Shaw formulations of fingerprinting. The proposed scheme has four useful properties: (1) the receiver does not need to know the coalition size and collusion channel; (2) a tunable parameter Δ trades off false-positive and false-negative error exponents; (3) the receiver provides a reliability metric for its decision; and (4) the decoder is capacity-achieving when the false-positive exponent Δ tends to zero. The new random coding scheme uses a "time-sharing" randomized sequence and produces conditionally constant-composition fingerprints. The decoder is a minimum penalized equivocation decoder, where the penalty term is proportional to coalition size.

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

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

U2 - 10.1109/ISIT.2008.4594980

DO - 10.1109/ISIT.2008.4594980

M3 - Conference contribution

AN - SCOPUS:52349091655

SN - 9781424422579

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 220

EP - 224

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

ER -