이 논문은 BCH (Bose-Chaudhuri-Hocquenghem) 코드 기반의 멀티미디어 핑거프린팅의 새로운 구현 알고리즘을 나타낸다. 공모자 검출의 평가는 n-1명 까지 이루어진다. 제안된 알고리즘에서, 사용된 공모공격은 논리조합(AND, OR 그리고 XOR) 과 평균화 계산(Averaging)이다. 핑거프린팅 코드의 생성 단계는 다음과 같다. 1, BIBD {7,4,1} 코드는 생기행렬로 생성된다. 2. BIBD 코드와 BCH 코드를 결합한 새로운 인코딩 방법에서, 두 종류의 코드들은 BCH 엔코딩 처리에 의해서 핑거프린팅 코드가 된다. 3. 단계 2에서 생성된 코드는 핑거프린팅 코드가 되며 BCH {15,7}코드와 유사한 특성을 갖는다. 4. 단계 3의 핑거프린팅 코드로, 공모자 검출을 위한 공모 코드북을 만든다. 실험을 통하여 공모자 검출비는 AND 공모에서 86.6%, OR 공모에서 32.8%, XOR 공모에서 0% 그리고 평균화 공모에서 66.4%임을 각각 확인하였다. 또한 XOR 공모는 전체 공모자를 검출할 수 없는 반면에, 평균화 공모는 n-1명의 공모자를 검출 하고 OR 공모는 k명의 공모자를 검출할 수 있었다.
이 논문은 BCH (Bose-Chaudhuri-Hocquenghem) 코드 기반의 멀티미디어 핑거프린팅의 새로운 구현 알고리즘을 나타낸다. 공모자 검출의 평가는 n-1명 까지 이루어진다. 제안된 알고리즘에서, 사용된 공모공격은 논리조합(AND, OR 그리고 XOR) 과 평균화 계산(Averaging)이다. 핑거프린팅 코드의 생성 단계는 다음과 같다. 1, BIBD {7,4,1} 코드는 생기행렬로 생성된다. 2. BIBD 코드와 BCH 코드를 결합한 새로운 인코딩 방법에서, 두 종류의 코드들은 BCH 엔코딩 처리에 의해서 핑거프린팅 코드가 된다. 3. 단계 2에서 생성된 코드는 핑거프린팅 코드가 되며 BCH {15,7}코드와 유사한 특성을 갖는다. 4. 단계 3의 핑거프린팅 코드로, 공모자 검출을 위한 공모 코드북을 만든다. 실험을 통하여 공모자 검출비는 AND 공모에서 86.6%, OR 공모에서 32.8%, XOR 공모에서 0% 그리고 평균화 공모에서 66.4%임을 각각 확인하였다. 또한 XOR 공모는 전체 공모자를 검출할 수 없는 반면에, 평균화 공모는 n-1명의 공모자를 검출 하고 OR 공모는 k명의 공모자를 검출할 수 있었다.
This paper presents a novel implementation on multimedia fingerprinting algorithm based on BCH (Bose-Chaudhuri-Hocquenghem) code. The evaluation is put in force the colluder detection to n-1. In the proposed algorit hm, the used collusion attacks adopt logical combinations (AND, OR and XOR) and aver...
This paper presents a novel implementation on multimedia fingerprinting algorithm based on BCH (Bose-Chaudhuri-Hocquenghem) code. The evaluation is put in force the colluder detection to n-1. In the proposed algorit hm, the used collusion attacks adopt logical combinations (AND, OR and XOR) and average computing (Averaging). The fingerprinting code is generated as below step: 1. BIBD {7,4,1} code is generated with incidence matrix. 2. A new encoding method namely combines BIBD code with BCH code, these 2 kind codes are to be fingerprinting code by BCH encoding process. 3. The generated code in step 2, which would be fingerprinting code, that characteristic is similar BCH {15,7} code. 4. With the fingerprinting code in step 3, the collusion codebook is constructed for the colluder detection. Through an experiment, it confirmed that the ratio of colluder detection is 86.6% for AND collusion, 32.8% for OR collusion, 0% for XOR collusion and 66.4% for Averaging collusion respectively. And also, XOR collusion could not detect entirely colluder and on the other hand, AND and Averaging collusion could detect n-1 colluders and OR collusion could detect k colluders.
This paper presents a novel implementation on multimedia fingerprinting algorithm based on BCH (Bose-Chaudhuri-Hocquenghem) code. The evaluation is put in force the colluder detection to n-1. In the proposed algorit hm, the used collusion attacks adopt logical combinations (AND, OR and XOR) and average computing (Averaging). The fingerprinting code is generated as below step: 1. BIBD {7,4,1} code is generated with incidence matrix. 2. A new encoding method namely combines BIBD code with BCH code, these 2 kind codes are to be fingerprinting code by BCH encoding process. 3. The generated code in step 2, which would be fingerprinting code, that characteristic is similar BCH {15,7} code. 4. With the fingerprinting code in step 3, the collusion codebook is constructed for the colluder detection. Through an experiment, it confirmed that the ratio of colluder detection is 86.6% for AND collusion, 32.8% for OR collusion, 0% for XOR collusion and 66.4% for Averaging collusion respectively. And also, XOR collusion could not detect entirely colluder and on the other hand, AND and Averaging collusion could detect n-1 colluders and OR collusion could detect k colluders.
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
제안 방법
In this paper, a new encoding method namely combines BIBD code with BCH code, these 2 kind codes are to be fingerprinting code by BCH encoding process for the colluder detection to n-1 according to the structured colluder codebook.
The proposed algorithm in this paper could be widely applied to trace up the illegal distributor of multimedia content on the various colluded attacks, which consisted of Logical operation and Averaging of fingerprinting code base on BIBD code combined with BCH code.
이론/모형
The remainder P(x) will be order of 7 or less. However, the calculation uses Galois field rule.
In this paper, the generation of multimedia fingerprinting code that is based on BCH code. Each code of media creator, provider and user must not know each other to be inserted to media content.
성능/효과
According to the collusion attack type, the number of detected colluders is presented in Table 1 and also, the detected colluders by number of attending colluders (2～6) and the ratio of colluder detection is presented. In the experiment of the proposed algorithm, it confirmed that the ratio of colluder detection is 86.6% for AND collusion, 32.8% for OR collusion, 0% for XOR collusion and 66.4% in Averaging collusion respectively. It is shown in Table 1 and Fig.
참고문헌 (20)
Jie Yang, Xiaoxia Xu, "A Robust Anti-collusion Coding in Digital Fingerprinting System," The 8th International Conference on Signal Processing, Vol. 4, 2006.
Jie Yang, Xiaoxia Xu, "A Robust Anti-collusion Coding in Digital Fingerprinting System," IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2006, pp. 996-999, 4-7 Dec. 2006.
Shashanka D., Bora P.K, "Collusion Secure Scalable Video Fingerprinting Scheme," International Conference on Advanced Computing and Communications, ADCOM 2007, pp. 641-647, 18-21 Dec. 2007.
Zang Li and Trappe W, "Collusion-resistant fingerprints from WBE sequence sets," IEEE International Conference on Communications, ICC 2005, Vol. 2, pp. 1336-1340, 16-20 May 2005.
In Koo Kang, Choong-Hoon Lee, Hae-Yeoun Lee, Jong-Tae Kim, Heung-Kyu Lee, "Averaging attack resilient video fingerprinting," IEEE International Symposium on Circuits and Systems, ISCAS 2005, Vol. 6, pp. 5529-5532, 23-26 May 2005.
J. S. Noh, Kang Hyeon RHEE, "Detection of Colluded Multimedia Fingerprint by Neural Network," IEEK Computer Society, Vol. 43, No. 4, pp. 80-87, July 2006.
Kang Hyeon RHEE, "Detection of Colluded Multimedia fingerprint using LDPC and BIBD," IEEK Computer Society, Vol. 43, No. 5, pp. 68-75, Sept. 2006.
J. Kilian, T. Leighton, L. R. Matheson, T. G. Shammon, R. E. Tarjan and F. Jane, "Resistance of Digital Watermarks to collusive Attacks," Tech. Rep., TR-585-98, Dept. of Computer Science, Princeton University, 1998.
Wade Trappe, Min Wu, Jane Wang and K. J. Ray Liu, "Anti-collusion Fingerprinting for Multimedia," IEEE Tran. on Signal Processing, Vol. 51, No.4, pp. 1069-1087, April 2003.
Kang Hyeon RHEE, "An Evaluation Algorithm of Multimedia Fingerprinting using BIBD code," APIC-IST & ICONI 2009, pp. 411-415, Dec. 2009.
Z. J. Wang, M.Wu, H. Zhao,W. Trappe, and K.J.R. Liu, "Resistance of Orthogonal Gaussian Fingerprints to collusion Attacks," Proc. of ICASSP, pp. 724-727, Apr. 2003.
Shan He andMin Wu, "Performance Study on Multimedia Fingerprinting Employing Traceability Codes," Vol. 3710/2005, pp. 84-96, 2005.
D. Boneh and J. Shaw, "Collusion-secure fingerprinting for digital data," IEEE Tran. on Information Theory, Vol. 44, pp. 1897-1905, September 1998.
http://www.lsi-contest.com/index_e.html
http://www.lsi-contest.com/shiyou_2e.htm
F. Sebe and Domingo-Ferrer, "Short 3-Secure Fingerprinting Codes for Copyright Protection," Lecture Notes in Computer Science, Vol. 2384, pp. 316-327, 2002.
J. Dittmann, "Combining Digital watermarks and Collusion Secure Fingerprints for Customer Copy Monitoring," Proc. IEE Seminar Sec. Image & Image Auth., pp. 128-132, Mar. 2000.
http://mathworld.wolfram.com/BlockDesign.html
Dinitz, J. H. and Stinson, D. R. "A Brief Introduction to Design Theory," Ch. 1 in Contemporary Design Theory: A Collection of Surveys (Ed. J. H. Dinitz and D. R. Stinson). New York: Wiley, pp.1-12, 1992.
Ryser, H. J. "The (b,v,r,k,lambda)-Configuration." 8.1 in Combinatorial Mathematics. Buffalo, NY: Math. Assoc. Amer., pp.96-102, 1963.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.