Analysis of binary fingerprinting codes under relaxed marking assumption

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

2 Citations (Scopus)

Abstract

There are many studies on the performance of binary fingerprinting codes under a well-known marking assumption. Among many fingerprinting codes, we focus on Tardos codes and Nuida's variants. From the signal processing point of view, the relaxation of the assumption is required for the analysis. In this paper, we consider the averaging attack which has been studied in the spread-spectrum-based fingerprinting schemes, and propose an optimal detector based on a maximum likelihood decoding. From our theoretical analysis about the effect on a pirated codeword caused by the averaging attack, it is revealed that the false-positive probability is strongly dependent on the number of colluders.

Original languageEnglish
Title of host publication2012 International Symposium on Information Theory and Its Applications, ISITA 2012
Pages643-647
Number of pages5
Publication statusPublished - 2012
Externally publishedYes
Event2012 International Symposium on Information Theory and Its Applications, ISITA 2012 - Honolulu, HI, United States
Duration: Oct 28 2012Oct 31 2012

Other

Other2012 International Symposium on Information Theory and Its Applications, ISITA 2012
CountryUnited States
CityHonolulu, HI
Period10/28/1210/31/12

Fingerprint

Binary codes
Maximum likelihood
Decoding
Signal processing
Detectors

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Kuribayashi, M. (2012). Analysis of binary fingerprinting codes under relaxed marking assumption. In 2012 International Symposium on Information Theory and Its Applications, ISITA 2012 (pp. 643-647). [6401018]

Analysis of binary fingerprinting codes under relaxed marking assumption. / Kuribayashi, Minoru.

2012 International Symposium on Information Theory and Its Applications, ISITA 2012. 2012. p. 643-647 6401018.

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

Kuribayashi, M 2012, Analysis of binary fingerprinting codes under relaxed marking assumption. in 2012 International Symposium on Information Theory and Its Applications, ISITA 2012., 6401018, pp. 643-647, 2012 International Symposium on Information Theory and Its Applications, ISITA 2012, Honolulu, HI, United States, 10/28/12.
Kuribayashi M. Analysis of binary fingerprinting codes under relaxed marking assumption. In 2012 International Symposium on Information Theory and Its Applications, ISITA 2012. 2012. p. 643-647. 6401018
Kuribayashi, Minoru. / Analysis of binary fingerprinting codes under relaxed marking assumption. 2012 International Symposium on Information Theory and Its Applications, ISITA 2012. 2012. pp. 643-647
@inproceedings{da565c52aee644c8b725d41b03cec5a8,
title = "Analysis of binary fingerprinting codes under relaxed marking assumption",
abstract = "There are many studies on the performance of binary fingerprinting codes under a well-known marking assumption. Among many fingerprinting codes, we focus on Tardos codes and Nuida's variants. From the signal processing point of view, the relaxation of the assumption is required for the analysis. In this paper, we consider the averaging attack which has been studied in the spread-spectrum-based fingerprinting schemes, and propose an optimal detector based on a maximum likelihood decoding. From our theoretical analysis about the effect on a pirated codeword caused by the averaging attack, it is revealed that the false-positive probability is strongly dependent on the number of colluders.",
author = "Minoru Kuribayashi",
year = "2012",
language = "English",
isbn = "9784885522673",
pages = "643--647",
booktitle = "2012 International Symposium on Information Theory and Its Applications, ISITA 2012",

}

TY - GEN

T1 - Analysis of binary fingerprinting codes under relaxed marking assumption

AU - Kuribayashi, Minoru

PY - 2012

Y1 - 2012

N2 - There are many studies on the performance of binary fingerprinting codes under a well-known marking assumption. Among many fingerprinting codes, we focus on Tardos codes and Nuida's variants. From the signal processing point of view, the relaxation of the assumption is required for the analysis. In this paper, we consider the averaging attack which has been studied in the spread-spectrum-based fingerprinting schemes, and propose an optimal detector based on a maximum likelihood decoding. From our theoretical analysis about the effect on a pirated codeword caused by the averaging attack, it is revealed that the false-positive probability is strongly dependent on the number of colluders.

AB - There are many studies on the performance of binary fingerprinting codes under a well-known marking assumption. Among many fingerprinting codes, we focus on Tardos codes and Nuida's variants. From the signal processing point of view, the relaxation of the assumption is required for the analysis. In this paper, we consider the averaging attack which has been studied in the spread-spectrum-based fingerprinting schemes, and propose an optimal detector based on a maximum likelihood decoding. From our theoretical analysis about the effect on a pirated codeword caused by the averaging attack, it is revealed that the false-positive probability is strongly dependent on the number of colluders.

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

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

M3 - Conference contribution

AN - SCOPUS:84873536552

SN - 9784885522673

SP - 643

EP - 647

BT - 2012 International Symposium on Information Theory and Its Applications, ISITA 2012

ER -