Unified model for fingerprinting code applications

The enormous popularity of digital contents contains unlicensed and illegal activities which are involved in different perspectives. Despite several efforts are made toward an illegal copy and redistribution (legal and technical), still the problems exist with growing use of digital application such as storing and distribution of contents, the problem is becoming more worrisome. Attaching a unique invisible marking to every unit of object, is viable trading with problems of unauthorized copying, that is if an illegal copy is released elsewhere, it is going to be practical to find the original owner of the object (traitor). This phenomenon of enforcement, in a copyright protection, is what is referred to as fingerprint code. Dealing with code, for fingerprinting in digital contents, in the context of several users combining (colluding) to create a new, unauthorized copy (pirate). Theoretical bounds on the performance in the code are realized, with general methods of theoretically observe whether certain users are involved in the illegal activity (copy and redistribution) is presented, through checkmate items. In this paper, we have introduces collusion–secure fingerprinting code have been similar to construction by aggeloss and serdar; but attain a shorter code in length, faster accusation by splitting the group of users in to partitions and allow for code over arbitrary alphabets, and asymmetric fingerprinting scheme out of symmetric scheme from the early idea work of tardos in his fingerprinting code.