A simple tracing algorithm for binary fingerprinting code under averaging attack

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

3 Citations (Scopus)

Abstract

When a binary fingerprinting codeword is embedded into digital contents using a spread-spectrum (SS) watermarking scheme, the marking assumption is not valid anymore because it is difficult for colluders to perform the symbol-wise attack for their codewords. As discussed in the SS-type fingerprinting schemes, veraging their copies is the cost-effective attack from the signal processing point of view. In this paper, we propose an optimal detector under the averaging attack and addition of white Gaussian noise. If the detector knows the number of colluders in advance, it first estimates the variance of additive noise, and then calculates the correlation scores using a log-likelihood-based approach. However, the number of colluders is not given in a real situation. We discover in this study that the characteristic of parameters for generating codewords enables us to eliminate the number of colluders as well as the estimation of the variance of noise at the calculation of correlation score, and propose a simplified detector by analyzing the scoring function in the optimal detector. We evaluate the performance of the simplified detector through simulation using not only codewords, but also a digital image.

Original languageEnglish
Title of host publicationIH and MMSec 2013 - Proceedings of the 2013 ACM Information Hiding and Multimedia Security Workshop
Pages3-11
Number of pages9
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event1st ACM Workshop on Information Hiding and Multimedia Security, IH and MMSec 2013 - Montpellier, France
Duration: Jun 17 2013Jun 19 2013

Other

Other1st ACM Workshop on Information Hiding and Multimedia Security, IH and MMSec 2013
CountryFrance
CityMontpellier
Period6/17/136/19/13

Fingerprint

Binary codes
Detectors
Additive noise
Watermarking
Signal processing
Costs

Keywords

  • collusion attack
  • fingerprinting
  • tracing algorithm

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Human-Computer Interaction
  • Software

Cite this

Kuribayashi, M. (2013). A simple tracing algorithm for binary fingerprinting code under averaging attack. In IH and MMSec 2013 - Proceedings of the 2013 ACM Information Hiding and Multimedia Security Workshop (pp. 3-11) https://doi.org/10.1145/2482513.2482521

A simple tracing algorithm for binary fingerprinting code under averaging attack. / Kuribayashi, Minoru.

IH and MMSec 2013 - Proceedings of the 2013 ACM Information Hiding and Multimedia Security Workshop. 2013. p. 3-11.

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

Kuribayashi, M 2013, A simple tracing algorithm for binary fingerprinting code under averaging attack. in IH and MMSec 2013 - Proceedings of the 2013 ACM Information Hiding and Multimedia Security Workshop. pp. 3-11, 1st ACM Workshop on Information Hiding and Multimedia Security, IH and MMSec 2013, Montpellier, France, 6/17/13. https://doi.org/10.1145/2482513.2482521
Kuribayashi M. A simple tracing algorithm for binary fingerprinting code under averaging attack. In IH and MMSec 2013 - Proceedings of the 2013 ACM Information Hiding and Multimedia Security Workshop. 2013. p. 3-11 https://doi.org/10.1145/2482513.2482521
Kuribayashi, Minoru. / A simple tracing algorithm for binary fingerprinting code under averaging attack. IH and MMSec 2013 - Proceedings of the 2013 ACM Information Hiding and Multimedia Security Workshop. 2013. pp. 3-11
@inproceedings{1a73281ff46543b99bf036144891f53a,
title = "A simple tracing algorithm for binary fingerprinting code under averaging attack",
abstract = "When a binary fingerprinting codeword is embedded into digital contents using a spread-spectrum (SS) watermarking scheme, the marking assumption is not valid anymore because it is difficult for colluders to perform the symbol-wise attack for their codewords. As discussed in the SS-type fingerprinting schemes, veraging their copies is the cost-effective attack from the signal processing point of view. In this paper, we propose an optimal detector under the averaging attack and addition of white Gaussian noise. If the detector knows the number of colluders in advance, it first estimates the variance of additive noise, and then calculates the correlation scores using a log-likelihood-based approach. However, the number of colluders is not given in a real situation. We discover in this study that the characteristic of parameters for generating codewords enables us to eliminate the number of colluders as well as the estimation of the variance of noise at the calculation of correlation score, and propose a simplified detector by analyzing the scoring function in the optimal detector. We evaluate the performance of the simplified detector through simulation using not only codewords, but also a digital image.",
keywords = "collusion attack, fingerprinting, tracing algorithm",
author = "Minoru Kuribayashi",
year = "2013",
doi = "10.1145/2482513.2482521",
language = "English",
pages = "3--11",
booktitle = "IH and MMSec 2013 - Proceedings of the 2013 ACM Information Hiding and Multimedia Security Workshop",

}

TY - GEN

T1 - A simple tracing algorithm for binary fingerprinting code under averaging attack

AU - Kuribayashi, Minoru

PY - 2013

Y1 - 2013

N2 - When a binary fingerprinting codeword is embedded into digital contents using a spread-spectrum (SS) watermarking scheme, the marking assumption is not valid anymore because it is difficult for colluders to perform the symbol-wise attack for their codewords. As discussed in the SS-type fingerprinting schemes, veraging their copies is the cost-effective attack from the signal processing point of view. In this paper, we propose an optimal detector under the averaging attack and addition of white Gaussian noise. If the detector knows the number of colluders in advance, it first estimates the variance of additive noise, and then calculates the correlation scores using a log-likelihood-based approach. However, the number of colluders is not given in a real situation. We discover in this study that the characteristic of parameters for generating codewords enables us to eliminate the number of colluders as well as the estimation of the variance of noise at the calculation of correlation score, and propose a simplified detector by analyzing the scoring function in the optimal detector. We evaluate the performance of the simplified detector through simulation using not only codewords, but also a digital image.

AB - When a binary fingerprinting codeword is embedded into digital contents using a spread-spectrum (SS) watermarking scheme, the marking assumption is not valid anymore because it is difficult for colluders to perform the symbol-wise attack for their codewords. As discussed in the SS-type fingerprinting schemes, veraging their copies is the cost-effective attack from the signal processing point of view. In this paper, we propose an optimal detector under the averaging attack and addition of white Gaussian noise. If the detector knows the number of colluders in advance, it first estimates the variance of additive noise, and then calculates the correlation scores using a log-likelihood-based approach. However, the number of colluders is not given in a real situation. We discover in this study that the characteristic of parameters for generating codewords enables us to eliminate the number of colluders as well as the estimation of the variance of noise at the calculation of correlation score, and propose a simplified detector by analyzing the scoring function in the optimal detector. We evaluate the performance of the simplified detector through simulation using not only codewords, but also a digital image.

KW - collusion attack

KW - fingerprinting

KW - tracing algorithm

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

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

U2 - 10.1145/2482513.2482521

DO - 10.1145/2482513.2482521

M3 - Conference contribution

SP - 3

EP - 11

BT - IH and MMSec 2013 - Proceedings of the 2013 ACM Information Hiding and Multimedia Security Workshop

ER -