Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces
Secure frameproof code is the name given to a separating code when studied in relation to fingerprinting schemes. Separating codes are combinatorial objects that have found to be useful in many areas such as technical diagnosis and the protection of distribution rights. A relaxed definition of the properties of separation and frameproofness, in the sense of only requiring the properties to hold with high probability, shows that for the relaxed definitions these notions are different. In this paper we address the construction of almost secure frameproof codes based on small-bias probability spaces.