Forgery Attack to an Asymptotically Optimal Traitor Tracing Scheme
نویسندگان
چکیده
In this paper, we present a forgery attack to a black-box traitor tracing scheme [2] called as CPP scheme. CPP scheme has efficient transmission rate and allows the tracer to identify a traitor with just one invalid ciphertext. Since the original CPP scheme is vulnerable to the multi-key attack, we improved CPP to thwart the attack. However, CPP is vulnerable to a fatal forgery attack. In the forgery attack, two traitors can collude to forge all valid decryption keys. The forged keys appear as perfect genuine keys, can decrypt all protected content, but are untraceable by the tracer. Fortunately, we can patch this weakness with increasing the decoder storage.
منابع مشابه
Public Traceability in Traitor Tracing Schemes
Traitor tracing schemes are of major importance for secure distribution of digital content. They indeed aim at protecting content providers from colluding users to build pirate decoders. If such a collusion happens, at least one member of the latter collusion will be detected. Several solutions have already been proposed in the literature, but the most important problem to solve remains having ...
متن کاملOptimal symmetric Tardos traitor tracing schemes
For the Tardos traitor tracing scheme, we show that by combining the symbol-symmetric accusation function of Škorić et al. with the improved analysis of Blayer and Tassa we get further improvements. Our construction gives codes that are up to 4 times shorter than Blayer and Tassa’s, and up to 2 times shorter than the codes from Škorić et al. Asymptotically, we achieve the theoretical optimal co...
متن کاملA Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares
We proposed a new public-key traitor tracing scheme with revocation capability using the dynamic share and entity revocation techniques. The enabling block of our scheme is independent of the number of subscribers, but dependent on the collusion and revocation thresholds. Each receiver holds one decryption key only. Our traitor tracing algorithm works in a black-box way and is conceptually simp...
متن کاملTraitor Tracing with Optimal Transmission Rate
We present the first traitor tracing scheme with efficient black-box traitor tracing in which the ratio of the ciphertext and plaintext lengths (the transmission rate) is asymptotically 1, which is optimal. Previous constructions in this setting either obtained constant (but not optimal) transmission rate [KY02b], or did not support black-box tracing [CPP05]. Our treatment improves the standard...
متن کاملA proven secure tracing algorithm for the optimal KD traitor tracing scheme (7 minutes for the Rump session)
A (k, n)-traceability scheme is a scheme in which at least one traitor is detected from a pirate key if there are at most k traitors among n authorized users. It has four components: key generation, an encryption algorithm, a decryption algorithm and a tracing algorithm. Kurosawa and Desmedt found lower bounds on the size of keys and the size of ciphertexts of traceability schemes [1]. They als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007