Combinatorial Construction of a 2_Secure Code
XU Guo-xia · Communications technology · 2008
Completely secure code does not exit, this argument has been theoretically proved. Any secure code is bound to fail in tracing traitors in some case. In this paper, a combinatorial construction of a 2_secure code by block design is presented. Every code word corresponds to a square matrix of order n. The length of the code word embedded in digital product is shorter than that of the corresponding matrix. When a piratical product is found, the colluders are traced not by the piratical code word but by the corresponding matrix. The tracing algorithm has efficient traceability, and it either fails or outputs a colluder ,that is to say, an important property of the algorithm is that no innocent users would be wronged.