Learn More
We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is O(√ T) where T is the mean time taken by the brute force algorithm) and can catch traitors, i.e., dishonest users who collude by giving subsets of their key(s) to others. The(More)
This paper addresses the problem of threshold traitor tracing for digital content where, by embedding appropriate digital patterns into the distributed content, it is possible to trace and identify the source of unauthorised redistribution. We use a set of marking assumptions where the adversaries have varying powers to change or erase coordinates of the(More)
  • 1