2-secure codes from 2-SFP codes
Vu Dong Tô, Reihaneh Safavi–Naini, Yejing Wang · Journal of Discrete Mathematical Sciences and Cryptography · 2005
Secure code and secure frameproof code (SFP) are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we present a general method of converting a binary 2-SFP code to a 2-secure code, that is providing a tracing algorithm and calculating ε, the chance of error in tracing. We express the error associated with this tracing in terms of n, the number of codewords in the code and d, the minimum Hamming distance of the code. We also characterize the set of pirate words such that the algorithm fails to trace. To illustrate the method, we first show that the dual Hamming code [6] is a 2-SFP code and we apply the proposed method for this code to obtain a 2-secure code.