High rate fingerprinting codes and the fingerprinting capacity

Ehsan Amiri, G. Tardos

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

60 Citations (Scopus)

Abstract

Including a unique code in each copy of a distributed document is an effective way of fighting intellectual piracy. Codes designed for this purpose that are secure against collusion attacks are called fingerprinting codes. In this paper we consider fingerprinting with the marking assumption and design codes that achieve much higher rates than previous constructions. We conjecture that these codes attain the maximum possible rate (the fingerprinting capacity) for any fixed number of pirates. We prove new upper bounds for the fingerprinting capacity that are not far from the rate of our codes. On the downside the accusation algorithm of our codes are much slower than those of earlier codes. We introduce the novel model of weak fingerprinting codes where one pirate should be caught only if the identity of all other pirates are revealed. We construct fingerprinting codes in this model with improved rates but our upper bound on the rate still applies. In fact, these improved codes achieve the fingerprinting capacity of the weak model by a recent upper bound. Using analytic techniques we compare the rates of our codes in the standard model and the rates of the optimal codes in the weak model. To our surprise these rates asymptotically agree, that is, their ratio tends to 1 as t goes to infinity. Although we cannot prove that each one of our codes in the standard model achieves the fingerprinting capacity, this proves that asymptotically they do.

Original languageEnglish
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Pages336-345
Number of pages10
Publication statusPublished - 2009
Event20th Annual ACM-SIAM Symposium on Discrete Algorithms - New York, NY, United States
Duration: Jan 4 2009Jan 6 2009

Other

Other20th Annual ACM-SIAM Symposium on Discrete Algorithms
CountryUnited States
CityNew York, NY
Period1/4/091/6/09

Fingerprint

Fingerprinting
Upper bound
Standard Model
Collusion Attack
Optimal Codes
Model

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Amiri, E., & Tardos, G. (2009). High rate fingerprinting codes and the fingerprinting capacity. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 336-345)

High rate fingerprinting codes and the fingerprinting capacity. / Amiri, Ehsan; Tardos, G.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2009. p. 336-345.

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

Amiri, E & Tardos, G 2009, High rate fingerprinting codes and the fingerprinting capacity. in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 336-345, 20th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, NY, United States, 1/4/09.
Amiri E, Tardos G. High rate fingerprinting codes and the fingerprinting capacity. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2009. p. 336-345
Amiri, Ehsan ; Tardos, G. / High rate fingerprinting codes and the fingerprinting capacity. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2009. pp. 336-345
@inproceedings{403ac8fba8ae48a689068afea3661932,
title = "High rate fingerprinting codes and the fingerprinting capacity",
abstract = "Including a unique code in each copy of a distributed document is an effective way of fighting intellectual piracy. Codes designed for this purpose that are secure against collusion attacks are called fingerprinting codes. In this paper we consider fingerprinting with the marking assumption and design codes that achieve much higher rates than previous constructions. We conjecture that these codes attain the maximum possible rate (the fingerprinting capacity) for any fixed number of pirates. We prove new upper bounds for the fingerprinting capacity that are not far from the rate of our codes. On the downside the accusation algorithm of our codes are much slower than those of earlier codes. We introduce the novel model of weak fingerprinting codes where one pirate should be caught only if the identity of all other pirates are revealed. We construct fingerprinting codes in this model with improved rates but our upper bound on the rate still applies. In fact, these improved codes achieve the fingerprinting capacity of the weak model by a recent upper bound. Using analytic techniques we compare the rates of our codes in the standard model and the rates of the optimal codes in the weak model. To our surprise these rates asymptotically agree, that is, their ratio tends to 1 as t goes to infinity. Although we cannot prove that each one of our codes in the standard model achieves the fingerprinting capacity, this proves that asymptotically they do.",
author = "Ehsan Amiri and G. Tardos",
year = "2009",
language = "English",
isbn = "9780898716801",
pages = "336--345",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

}

TY - GEN

T1 - High rate fingerprinting codes and the fingerprinting capacity

AU - Amiri, Ehsan

AU - Tardos, G.

PY - 2009

Y1 - 2009

N2 - Including a unique code in each copy of a distributed document is an effective way of fighting intellectual piracy. Codes designed for this purpose that are secure against collusion attacks are called fingerprinting codes. In this paper we consider fingerprinting with the marking assumption and design codes that achieve much higher rates than previous constructions. We conjecture that these codes attain the maximum possible rate (the fingerprinting capacity) for any fixed number of pirates. We prove new upper bounds for the fingerprinting capacity that are not far from the rate of our codes. On the downside the accusation algorithm of our codes are much slower than those of earlier codes. We introduce the novel model of weak fingerprinting codes where one pirate should be caught only if the identity of all other pirates are revealed. We construct fingerprinting codes in this model with improved rates but our upper bound on the rate still applies. In fact, these improved codes achieve the fingerprinting capacity of the weak model by a recent upper bound. Using analytic techniques we compare the rates of our codes in the standard model and the rates of the optimal codes in the weak model. To our surprise these rates asymptotically agree, that is, their ratio tends to 1 as t goes to infinity. Although we cannot prove that each one of our codes in the standard model achieves the fingerprinting capacity, this proves that asymptotically they do.

AB - Including a unique code in each copy of a distributed document is an effective way of fighting intellectual piracy. Codes designed for this purpose that are secure against collusion attacks are called fingerprinting codes. In this paper we consider fingerprinting with the marking assumption and design codes that achieve much higher rates than previous constructions. We conjecture that these codes attain the maximum possible rate (the fingerprinting capacity) for any fixed number of pirates. We prove new upper bounds for the fingerprinting capacity that are not far from the rate of our codes. On the downside the accusation algorithm of our codes are much slower than those of earlier codes. We introduce the novel model of weak fingerprinting codes where one pirate should be caught only if the identity of all other pirates are revealed. We construct fingerprinting codes in this model with improved rates but our upper bound on the rate still applies. In fact, these improved codes achieve the fingerprinting capacity of the weak model by a recent upper bound. Using analytic techniques we compare the rates of our codes in the standard model and the rates of the optimal codes in the weak model. To our surprise these rates asymptotically agree, that is, their ratio tends to 1 as t goes to infinity. Although we cannot prove that each one of our codes in the standard model achieves the fingerprinting capacity, this proves that asymptotically they do.

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

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

M3 - Conference contribution

SN - 9780898716801

SP - 336

EP - 345

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

ER -