Bias-Based Binary Fingerprinting Code under Erasure Channel

Minoru Kuribayashi

Research output: Contribution to journal › Article

Abstract

Robustness against collusion attack has been measured under the marking assumption in fingerprinting codes. However, if codeword symbols are embedded into segments of multimedia content, the assumption must be relaxed. In this study, we investigate erasures both in segments of multimedia content and in codeword symbols. The former erasure represents the case of a clipping attack, and the latter occurs at the signal processing domain in which a watermark is embedded. We propose an optimal tracing algorithm under the erasure attack and theoretically estimate the number of erasure symbols in a pirated codeword. To suppress false-positive detections, a cutoff parameter is introduced into the tracing algorithm.

Original languageEnglish
JournalIEEE Signal Processing Letters
DOIs
Publication statusAccepted/In press - Aug 2 2018

Fingerprint

Binary codes
Fingerprinting
Binary
Tracing
Multimedia
Attack
Collusion Attack
Clipping
Signal processing
Watermark
False Positive
Signal Processing
Robustness
Estimate

Keywords

  • Distortion
  • erasure
  • Fingerprint recognition
  • fingerprinting code
  • optimal tracing algorithm
  • Probability
  • Robustness
  • Signal processing algorithms
  • Watermarking

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

Bias-Based Binary Fingerprinting Code under Erasure Channel. / Kuribayashi, Minoru.

In: IEEE Signal Processing Letters, 02.08.2018.

Research output: Contribution to journal › Article

Kuribayashi, M 2018, 'Bias-Based Binary Fingerprinting Code under Erasure Channel', IEEE Signal Processing Letters. https://doi.org/10.1109/LSP.2018.2863034
Kuribayashi M. Bias-Based Binary Fingerprinting Code under Erasure Channel. IEEE Signal Processing Letters. 2018 Aug 2. https://doi.org/10.1109/LSP.2018.2863034
Kuribayashi, Minoru. / Bias-Based Binary Fingerprinting Code under Erasure Channel. In: IEEE Signal Processing Letters. 2018.
@article{712fedb7f57b4d4eb623f179e11f242d,
title = "Bias-Based Binary Fingerprinting Code under Erasure Channel",
abstract = "Robustness against collusion attack has been measured under the marking assumption in fingerprinting codes. However, if codeword symbols are embedded into segments of multimedia content, the assumption must be relaxed. In this study, we investigate erasures both in segments of multimedia content and in codeword symbols. The former erasure represents the case of a clipping attack, and the latter occurs at the signal processing domain in which a watermark is embedded. We propose an optimal tracing algorithm under the erasure attack and theoretically estimate the number of erasure symbols in a pirated codeword. To suppress false-positive detections, a cutoff parameter is introduced into the tracing algorithm.",
keywords = "Distortion, erasure, Fingerprint recognition, fingerprinting code, optimal tracing algorithm, Probability, Robustness, Signal processing algorithms, Watermarking",
author = "Minoru Kuribayashi",
year = "2018",
month = "8",
day = "2",
doi = "10.1109/LSP.2018.2863034",
language = "English",
journal = "IEEE Signal Processing Letters",
issn = "1070-9908",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Bias-Based Binary Fingerprinting Code under Erasure Channel

AU - Kuribayashi, Minoru

PY - 2018/8/2

Y1 - 2018/8/2

N2 - Robustness against collusion attack has been measured under the marking assumption in fingerprinting codes. However, if codeword symbols are embedded into segments of multimedia content, the assumption must be relaxed. In this study, we investigate erasures both in segments of multimedia content and in codeword symbols. The former erasure represents the case of a clipping attack, and the latter occurs at the signal processing domain in which a watermark is embedded. We propose an optimal tracing algorithm under the erasure attack and theoretically estimate the number of erasure symbols in a pirated codeword. To suppress false-positive detections, a cutoff parameter is introduced into the tracing algorithm.

AB - Robustness against collusion attack has been measured under the marking assumption in fingerprinting codes. However, if codeword symbols are embedded into segments of multimedia content, the assumption must be relaxed. In this study, we investigate erasures both in segments of multimedia content and in codeword symbols. The former erasure represents the case of a clipping attack, and the latter occurs at the signal processing domain in which a watermark is embedded. We propose an optimal tracing algorithm under the erasure attack and theoretically estimate the number of erasure symbols in a pirated codeword. To suppress false-positive detections, a cutoff parameter is introduced into the tracing algorithm.

KW - Distortion

KW - erasure

KW - Fingerprint recognition

KW - fingerprinting code

KW - optimal tracing algorithm

KW - Probability

KW - Robustness

KW - Signal processing algorithms

KW - Watermarking

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

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

U2 - 10.1109/LSP.2018.2863034

DO - 10.1109/LSP.2018.2863034

M3 - Article

AN - SCOPUS:85051000079

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

SN - 1070-9908

ER -

Access to Document