A Collusion-Resistant Asymmetric Public-Key Traitor Tracing Scheme for Multi-channel Services

A new traitor tracing scheme is proposed , whose essential idea is the session key S is divided into a sum of S1 and S2. Based on DL(discrete logarithm)problem, S1 is decrypted by introducing a multi-channel service parameter and a special polynomial function, S2 is decrypted by Chinese Remainder Theorem. The new scheme has many advantages such as multi-service, collusion-resistance, asymmetry, long-lived subscribers key and black-box tracing. It is proved to be semantically secure under the DDH (Diffie-Hellman Problem) assumption and its whole capabilities are much better than that of the existing ones.