• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.1
• /
• pp.46-56
• /
• 2012

Traitor Tracing schemes are broadcast encryption systems where at least one of the traitors who were implicated in the construction of a pirate decoder can be traced. This traceability is required in various contents delivery system like satellite broadcast, DMB, pay-TV, DVD and so on. In this paper, we propose a public key traitor tracing scheme with key-update method. If the system manager can update a secret key which is stored in an authorized decode, it makes a pirate decoder useless by updating a secret key A pirate decoder which cannot update a secret key does not decrypt contents in next session or during tracing a traitor, this scheme has merits which will make a pirate decoder useless, therefore this scheme raises the security to a higher level.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1831-1834
• /
• 2003

부정자 추적 기법(traitor tracing)은 컨텐츠에 대한 무단 배포, 불법 복사 등의 부정 행위를 한 부정자(traitor)를 추적할 수 있는 방식이다. 본 논문은 부정자 추적 기법을 이용하여 디지털 방송용 컨텐츠 보호 시스템 모델을 구성하고자 한다. 기존의 traitor tracing 기법들이 암호학적 측면에서 키 유출에 대한 부정을 추적하기 위한 방식들이었다면, dynamic traitor tracing 기법과 sequential traitor tracing 기법은 복호화된 후의 컨텐츠에 대한 부정 배포를 막기 위한 방식이다. 본 논문에서는 sequential traitor tracing 기법을 기반으로 하여 컨텐츠 암호화 키 생성 및 전송 그리고 키 유출에 대한 추적 기능까지 제공하는 부정자 추적 기법을 제안하여 디지털 방송용 컨텐츠 보호 시스템에 대한 모델을 구성하고자 한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.6
• /
• pp.1231-1242
• /
• 2012

Traitor tracing schemes deter traitors from sharing their private keys by tracing at least one of the subscribers who were implicated in the construction of a pirate decoder. In general, it is assumed that the system manager in the scheme generates and distributes the subscribers' private key. But if the system manager knows the subscribers' private keys, he cannot convince a third party of a certain subscriber's piracy. To solve this problem, the system manager should not know the whole parts of subscribers' private keys and this leads to researches of asymmetric schemes. Moreover for the purpose of enhancing subscribers' privacy, there were two proposals of introducing anonymity onto asymmetric traitor tracing schemes, but one of them turned out to be a failure. In this paper, we point out that the other proposal also has flaws. We consider how to introduce anonymity to traitor tracing schemes, as a result, we suggest a new framework which is practical. We also construct a scheme by using an anonymous credential system and an asymmetric traitor tracing scheme. We prove the security of our scheme and consider the typical applications.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.121-127
• /
• 2003

The threshold value of the traitor-tracing schemes means a maximum number of traitors whose identities can be uniquely exposed using the tracing scheme. In the traitor-tracing scheme based on an error-correcting code, which is focused at this paper, the threshold value is determined by the error-correcting capability of the underlying error-correcting code. Analyzed in terms of a combinatorial property of the tracing scheme is the resulting effect on the tracing scheme when the collusion size is over the threshold value, and a possibility of two disjoint groups of users making an identical unauthorized decryption key is shown.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.5
• /
• pp.31-42
• /
• 2001

Two important requirements in broadcast encryption schemes are traitor traceability and revocability. In this paper, we propose a new type of a traitor tracing scheme that can revoke an unlimited number of traitors\` personal keys. Additionally, we propose an efficient and simple method to provide self-enforcement property. We also describe a variant of our scheme of which encryption algorithm is secure against adaptive chosen ciphertext attacks.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.99-101
• /
• 2002

At ACISP'02, H.J. Kim et al.[1] proposed a new traitor tracing scheme. However, this paper show that the proposed scheme is to be insecure by presenting a conspiracy attack. Using our attack, any two subscribers can collaborate to derive the secret key of the data supplier and tell or sell it to any body. Thus, the unauthorized user can always decrypt the encrypted session key with the decrypted session key. Also the two subscribers cannot be traced by the data supplier

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.3
• /
• pp.49-61
• /
• 2004

In broadcast encryption schemes, traceability is a useful property to trace authorized subscribers, called traitors, who collude for manufacturing a pirate decoder. Unfortunately, this is usually achieved with a sacrifice of a privacy. Most traitor tracing schemes in the literature have been developed without considering a subscriber's anonymity, which is one of important requirements for electronic marketplaces to offer similar privacy as current marketplace. It would be unsatisfactory for the subscriber to reveal his/her identity to purchase multimedia contents. In this paper we propose an anonymous broadcast encryption scheme, where a user can subscribe anonymously and one purchases multimedia contents without giving a lot of information about his lifestyle, habits, and etc, but anonymity control is provided, i.e., a data supplier can date traitors.

• 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 Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.311-313
• /
• 2003

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