Worst case attacks against binary probabilistic traitor tracing codes

Details Worst case attacks against binary probabilistic traitor tracing codes Worst case attacks against binary probabilistic traitor tracing codes

2009-03-20

arxiv.org/abs/0903.3480v2

Computer Science

Information Theory

submitted to IEEE Trans. on Information Forensics and Security

Scientific paper

An insightful view into the design of traitor tracing codes should necessarily consider the worst case attacks that the colluders can lead. This paper takes an information-theoretic point of view where the worst case attack is defined as the collusion strategy minimizing the achievable rate of the traitor tracing code. Two different decoders are envisaged, the joint decoder and the simple decoder, as recently defined by P. Moulin \cite{Moulin08universal}. Several classes of colluders are defined with increasing power. The worst case attack is derived for each class and each decoder when applied to Tardos' codes and a probabilistic version of the Boneh-Shaw construction. This contextual study gives the real rates achievable by the binary probabilistic traitor tracing codes. Attacks usually considered in literature, such as majority or minority votes, are indeed largely suboptimal. This article also shows the utmost importance of the time-sharing concept in a probabilistic codes.

Affiliated with

Also associated with

No associations

Rating

Worst case attacks against binary probabilistic traitor tracing codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Worst case attacks against binary probabilistic traitor tracing codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Worst case attacks against binary probabilistic traitor tracing codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-641829