Digital fingerprinting is a useful technique for tracing the illegal user who redistributes the digital contents. To use this fingerprint, have to consider the collusion attack which several users collude to make illegal content. Among the collusion attacks, averaging attack is simple, fast and efficient general attack.
Anti-collusion code is used as fingerprint code for its robustness to averaging attack and code efficiency. But as the code's length is increasing, it is hard to trace proper colluders for the threshold problem. For the detection of right colluders, this paper addresses an efficient technique to embed and detect fingerprinting code. Proposed zero-based code modulation embeds the only 0's in the anti-collusion code and detects the position of 0's using the corresponding orthogonal signal. Using this method, the threshold can be decided by the watermark detection algorithm.
To analyze the performance, (72, 89, 9, 8, 0, 1)GD-PBIBD is used as fingerprint code and implements a video fingerprinting system in which blind strategy is used on frequency domain. The results show that the proposed method can efficiently handle large fingerprint code and trace colluders against averaging attacks.
공모 방지 코드는 하나의 직교 신호를 핑거프린트로 사용하는 직교변조 방식에 비해 보다 많은 사용자에게 핑거프린트를 제공하는 장점을 갖고 있지만 이러한 공모 방지 코드를 일반적인 코드변조 방식을 통해 핑거프린트로 삽입 했을 때 임계값 결정의 어려움으로 인해 잘못된 공모자 추적 및 공모자 추출 실패라는 문제점이 발생한다. 따라서 본 논문에서는 공모 방지 코드로 사용되는 GD-PBIBD 또는 BIBD의 코드의 특성을 고려한 제로 기반 코드변조 기법을 제안함으로 임계값 결정의 문제를 해결하도록 하였다.
