Simplified MAP detector for binary fingerprinting code embedded by spread spectrum watermarking scheme

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

When a binary fingerprinting codeword is embedded into multimedia content by using a spread-spectrum (SS) watermarking scheme, it is difficult for colluders to perform a symbol-wise attack using their codewords. As discussed in regard to SS fingerprinting schemes, averaging their copies is a cost-effective attack from the signal processing point of view. If the number of colluders is known, an optimal detector can be used against an averaging attack with added white Gaussian noise. The detector first estimates the variance of additive noise, and then calculates correlation scores using a log-likelihood-based approach. However, the number of colluders is not usually known in a real situation. In this paper, we simplify the optimal detector by making statistical approximations and using the characteristics of the parameters for generating codewords. After that, we propose an orthogonal frequency division multiplexing-based SS watermarking scheme to embed the fingerprinting codeword into multimedia content. In a realistic situation, the signal embedded as a fingerprint is in principle attenuated by lossy compression. Because the signal amplitude in a pirated codeword is attenuated, we should adaptively estimate the parameters before calculating the scores. Different from the optimal detector, the simplified detector can easily accommodate changes in signal amplitude by examining the distorted codeword extracted from a pirated copy. We evaluate the performance of the simplified detector through simulation using digital images as well as codewords.

Original languageEnglish
Article number6737234
Pages (from-to)610-623
Number of pages14
JournalIEEE Transactions on Information Forensics and Security
Volume9
Issue number4
DOIs
Publication statusPublished - Apr 1 2014
Externally publishedYes

Fingerprint

Binary codes
Watermarking
Detectors
Additive noise
Orthogonal frequency division multiplexing
Signal processing
Costs

Keywords

  • averaging attack
  • Fingerprinting code
  • spread spectrum watermarking
  • tracing algorithm

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Safety, Risk, Reliability and Quality

Cite this

@article{93fb4033b02c4932bb59efafcbcb9b3e,
title = "Simplified MAP detector for binary fingerprinting code embedded by spread spectrum watermarking scheme",
abstract = "When a binary fingerprinting codeword is embedded into multimedia content by using a spread-spectrum (SS) watermarking scheme, it is difficult for colluders to perform a symbol-wise attack using their codewords. As discussed in regard to SS fingerprinting schemes, averaging their copies is a cost-effective attack from the signal processing point of view. If the number of colluders is known, an optimal detector can be used against an averaging attack with added white Gaussian noise. The detector first estimates the variance of additive noise, and then calculates correlation scores using a log-likelihood-based approach. However, the number of colluders is not usually known in a real situation. In this paper, we simplify the optimal detector by making statistical approximations and using the characteristics of the parameters for generating codewords. After that, we propose an orthogonal frequency division multiplexing-based SS watermarking scheme to embed the fingerprinting codeword into multimedia content. In a realistic situation, the signal embedded as a fingerprint is in principle attenuated by lossy compression. Because the signal amplitude in a pirated codeword is attenuated, we should adaptively estimate the parameters before calculating the scores. Different from the optimal detector, the simplified detector can easily accommodate changes in signal amplitude by examining the distorted codeword extracted from a pirated copy. We evaluate the performance of the simplified detector through simulation using digital images as well as codewords.",
keywords = "averaging attack, Fingerprinting code, spread spectrum watermarking, tracing algorithm",
author = "Minoru Kuribayashi",
year = "2014",
month = "4",
day = "1",
doi = "10.1109/TIFS.2014.2305799",
language = "English",
volume = "9",
pages = "610--623",
journal = "IEEE Transactions on Information Forensics and Security",
issn = "1556-6013",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Simplified MAP detector for binary fingerprinting code embedded by spread spectrum watermarking scheme

AU - Kuribayashi, Minoru

PY - 2014/4/1

Y1 - 2014/4/1

N2 - When a binary fingerprinting codeword is embedded into multimedia content by using a spread-spectrum (SS) watermarking scheme, it is difficult for colluders to perform a symbol-wise attack using their codewords. As discussed in regard to SS fingerprinting schemes, averaging their copies is a cost-effective attack from the signal processing point of view. If the number of colluders is known, an optimal detector can be used against an averaging attack with added white Gaussian noise. The detector first estimates the variance of additive noise, and then calculates correlation scores using a log-likelihood-based approach. However, the number of colluders is not usually known in a real situation. In this paper, we simplify the optimal detector by making statistical approximations and using the characteristics of the parameters for generating codewords. After that, we propose an orthogonal frequency division multiplexing-based SS watermarking scheme to embed the fingerprinting codeword into multimedia content. In a realistic situation, the signal embedded as a fingerprint is in principle attenuated by lossy compression. Because the signal amplitude in a pirated codeword is attenuated, we should adaptively estimate the parameters before calculating the scores. Different from the optimal detector, the simplified detector can easily accommodate changes in signal amplitude by examining the distorted codeword extracted from a pirated copy. We evaluate the performance of the simplified detector through simulation using digital images as well as codewords.

AB - When a binary fingerprinting codeword is embedded into multimedia content by using a spread-spectrum (SS) watermarking scheme, it is difficult for colluders to perform a symbol-wise attack using their codewords. As discussed in regard to SS fingerprinting schemes, averaging their copies is a cost-effective attack from the signal processing point of view. If the number of colluders is known, an optimal detector can be used against an averaging attack with added white Gaussian noise. The detector first estimates the variance of additive noise, and then calculates correlation scores using a log-likelihood-based approach. However, the number of colluders is not usually known in a real situation. In this paper, we simplify the optimal detector by making statistical approximations and using the characteristics of the parameters for generating codewords. After that, we propose an orthogonal frequency division multiplexing-based SS watermarking scheme to embed the fingerprinting codeword into multimedia content. In a realistic situation, the signal embedded as a fingerprint is in principle attenuated by lossy compression. Because the signal amplitude in a pirated codeword is attenuated, we should adaptively estimate the parameters before calculating the scores. Different from the optimal detector, the simplified detector can easily accommodate changes in signal amplitude by examining the distorted codeword extracted from a pirated copy. We evaluate the performance of the simplified detector through simulation using digital images as well as codewords.

KW - averaging attack

KW - Fingerprinting code

KW - spread spectrum watermarking

KW - tracing algorithm

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

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

U2 - 10.1109/TIFS.2014.2305799

DO - 10.1109/TIFS.2014.2305799

M3 - Article

VL - 9

SP - 610

EP - 623

JO - IEEE Transactions on Information Forensics and Security

JF - IEEE Transactions on Information Forensics and Security

SN - 1556-6013

IS - 4

M1 - 6737234

ER -