Near Optimal Probabilistic Constructions of Frameproof Codes

Frameproof codes are a class of secure codes that were originally introduced in the pioneering work of Boneh and Shaw in the context of digital fingerprinting. They can be used to enhance the security and credibility of digital contents. Let M-c,M-l(q) denote the largest cardinality of a q-ary c-frameproof code with length l. Based on an intriguing observation that relates Mc,l(q) to the renowned Erdos Matching Conjecture in extremal set theory, in 2003, Blackburn posed an open problem on the precise value of the limit R-c,R-l=lim(q ->infinity)M(c,l)(q)/q(left perpendicularl/cright perpendicular). By combining several ideas from the probabilistic method, we present a lower bound for M-c,M-l(q) , which, together with an upper bound of Blackburn, completely determines R-c,R-l for all fixed c,l , and resolves the above open problem in the full generality. We also present an improved upper bound for M-c,M-l(q) .