作者: Reihaneh Safavi-Naini , Yejing Wang
关键词: Traceability 、 Scheme (programming language) 、 Traitor tracing 、 Encryption 、 Tracing 、 Broadcasting 、 Algorithm 、 Convergence (routing) 、 Computer science 、 Computation
摘要: Traceability schemes allow detection of at least one traitor when a group colluders attempt to construct pirate decoder and gain illegal access digital content.Fiat Tassa proposed dynamic tracing that can detect all traitors if they rebroadcast the content after it is decrypted.In their scheme broken into segments marked so re-broadcasted segment be linked particular subgroup users.Mark allocation for determined re-broadcast from previous observed.They showed by careful design mark possible traitors. We consider same scenario as Fiat propose new type traceability scheme, called sequential tracing, efficiently does not require any real-time computation. That is, marking pre-determined independent segment.This very attractive allows shortened hence overall convergence time reduced. We analyse give two general constructions based on special function family, other error correcting codes. obtain these show codes has which best known result schemes.