• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.175-180
• /
• 2013

For the traitor tracing of multimedia content, this paper presents the classification algorithm of XOR collusion attack types using hamming distance, which applies to the colluded fingerprinting codes. The conventional traitor decision hinges on the colluded fingerprinting code used by a correlation coefficient, but the proposed scheme uses hamming distance. While XOR collusion attack employing a correlation coefficient is impossible to trace the traitors about 50% colluders due to a serious XOR linear problem, our method improves the performance of traceability to trace at least 1 traitor using hamming distance, and thus, the functional behavior of the proposed traitor traceability is coincided with Probability Scheme.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.229-233
• /
• 2002

디지털 핑거프린팅(digital fingerprinting)은 멀티미디어 컨텐츠에 구매자의 정보를 삽입하여 불법적으로 컨텐츠를 재분배한 부정자(traitor)를 추적하는 기법이다. 기존에 제안된 대부분의 핑거프린팅 기법은 부정자를 식별하는 단계(identification protocol) 또는 그 증거를 제 3자에게 제출하여 확신받는 단계(trial protocol)까지만 고려했다. 대개의 경우 판매자는 해당 컨텐츠에서 부정자의 정보를 추출하여 그 신원을 확인하므로 재분배자 식별 단계를 거친 판매자는 해당구매자의 정보를 알 수 있게 된다. 따라서 판매자는 이를 이용하여 원 컨텐츠에 해당 구매자의 정보를 삽입할 수 있으며, 이로 인해 또 다른 문제가 발생할 수 있다. 본 논문에서는 재분배자 식별 단계 이후, 판매자가 불법적으로 구매자의 정보를 컨텐츠에 삽입할 가능성을 제기하고, 이 문제를 해결하기 위해 2단계 핑거프린팅 기법을 이용한 익명 핑거프린팅 방식을 제안한다.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.357-359
• /
• 2007

In order to protect copyrighted materials, codes may be embedded in the content -to trace the traitors. Traceability (TA) codes, as a kind of such codes, have been extensively studied in the intervening years for use as a piracy deterrent. In this correspondence, we proposed a method to construct a class of traceability codes and gave out some parameters results of such codes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.311-313
• /
• 2003

본 논문은 , 내용 은닉 서명［1］과 시간-잠금 퍼즐［2］을 이용해서 익명성을 보장하는 ［3］의 공모자 추적 스킴이 사실상 익명성을 갖지 않는다는 것에 대해서 보인다. 그 다음, 신뢰 기관을 이용하여 익명성을 보장하는 두개의 스킴을 제시한다. 첫 번째 스킴은 게시판과 ［4］의 영지식에서의 증명을 이용해서 ［3］에 제시된 스킴을 변형시켜 익명성을 보장한다. 두 번째 스킴은 ［5］의 비대칭 공모자 추적 스킴을 이용해서 익명성을 보장하는 공개키 공모자 추적 스킴을 제공한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.37-43
• /
• 2015

Technical treatments of image contents on the web include the copy protection method such as the image capture protection technology and the traitor tracing method to detect unauthorized duplications through watermarking insertion or feature information technology. However, these two methods have their own weaknesses. The image capture protection method is unable to protect illegal captures when the URLs of image sources are exposed. The traitor tracing method is fundamentally unable to protect illegal captures due to its post-treatment method. Besides, the weakness of using the copyright information display technology involves easy removal of copyright information from copyrighted contents. This paper suggests a model of the web image contents protection system which makes it hard to separate copyright information from web image contents and allows image contents to be shown only in the authorized websites.

• Journal of Internet Computing and Services
• /
• v.9 no.6
• /
• pp.81-87
• /
• 2008

In this paper, we propose a forensic watermarking scheme using temporal differences of video chrominance values. Proposed method has low complexity and good visual quality, which is suitable for traitor tracing of digital cinema. Experimental results show that our forensic watermarking method has good detection performance and is robust to several attacks, such as camcorder recording and video compression.

• Journal of IKEEE
• /
• v.15 no.3
• /
• pp.241-247
• /
• 2011

In this paper, it was implemented an algorithm of multimedia fingerprinting in DCT block. For the improvement of the limits of DRM’s ability, the proposed algorithm could be decided a responsibility boundary to judge a traitor who falsified the content according to perform separately a watermarking of content provider and a fingerprinting of content user. At the test image size($128{\times}128$) and block size($8{\times}8$) of the content provider, the measured PSNR is Inf~46.6dB with watermarking strength ${\Theta}=0.5{\sim}1.2$, and at a number of users and user's code length are n=7,15,31,63 and l=7,15,31,64 each, the measured PSNR is Inf~46.1 with fingerprinting code length l=7,15,31,63. Finally, a traitor tracing of the falsified content is approached to a trace ratio 1 which is extended to n-1.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.1
• /
• pp.17-30
• /
• 2016

In this paper, we propose an efficient public key trace and revoke scheme. An trace and revoke scheme is a broadcast encryption scheme which has a tracing and revocation algorithm. It would maintain security of the scheme to revoke pirate keys which are colluded by malicious users. In addition, property of revocation can be applied to various circumstances because it can help cipher text delivered to certain users who are supposed to. In this paper, we would change the scheme[Augmented broadcast encryption scheme] based on the bilinear groups of the composite order into that of prime order and we can improve the size of public key, secret key, ciphertext considerably. Furthermore, we define property of revocation precisely, so we can obtain the result that the scheme with limited revocation can be expanded to have a full revocation. This paper can be easily applied to the organization such as government, military, which has a hierarchical structure.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.4
• /
• pp.47-57
• /
• 2000

This paper proposes efficient anonymous fingerprinting with improved automatic identification of redistributors in electronic commerce of digital contents. The proposed scheme by Domingos in Eletronic Letters is inefficient in electronic commerce, because of pass numbers in registration protocol and exponential computations in identification protocol. Our scheme is reduced 2-pass in registraton protocol and is required only 1 time exponential computation than his in identification protocol. According to electronic commerce of digital contents used in ordinary life, our schemes values are increased.