A multi-service oriented collusion-resistant asymmetric public-key traitor tracing scheme
Xuejun Zhang, Zhiyong Zeng · Journal of Xidian University · 2006
The session key S is divided into a sum of S_1 and S_2.Under the condition of a large integer factoring problem,S_1 is decrypted by constructing a special polynomial function (scheme 1).Under the condition of the discrete logarithm problem,S_2 is decrypted by the Chinese Remainder Theorem(scheme 2).On the basis of a combination of scheme 1 and scheme 2,a new traitor tracing scheme is formed,which has advantages of both of them,meanwhile it overcomes their disadvantages.It has many advantages such as multi-service,collusion-resistance,asymmetry,long-lived subscriber's key and black-box tracing.