A Collusion-resistant Asymmetric Public-key Traitor Tracing Scheme
Xue Zhang · 2006
The session key S is divided into a sum of S_1 and S_2. Under the condition of large integer factoring problem, S_1 is decrypted by constructing a special polynomial function(scheme 1). Under the condition of discrete logarithm problem, S_2 is decrypted by Chinese Remainder Theorem(scheme 2).On the basis of a combination of the scheme 1 and scheme 2, a new traitor tracing scheme is formed, which has both advantages of them, meanwhile overcomes their disadvantages. It has many advantages such as collusion-resistance, asymmetry, long-lived subscriber's key, and black-box tracing.