TY - JOUR
T1 - Bias-based binary fingerprinting code under erasure channel
AU - Kuribayashi, Minoru
N1 - Funding Information:
Manuscript received April 30, 2018; revised July 24, 2018; accepted July 31, 2018. Date of publication August 3, 2018; date of current version August 10, 2018. This work was supported in part by JSPS KAKENHI under Grant JP16K00185. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Roberto Caldelli.
PY - 2018/9
Y1 - 2018/9
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 letter, 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 letter, 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 - Erasure
KW - fingerprinting code
KW - optimal tracing algorithm
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
VL - 25
SP - 1423
EP - 1427
JO - IEEE Signal Processing Letters
JF - IEEE Signal Processing Letters
SN - 1070-9908
IS - 9
M1 - 8424840
ER -