9:00 AM-10:00 AM
Chair: Derek Corneil, University of Toronto, Canada
Room: Earth Science Center Auditorium
Frameproof codes were introduced by Boneh and Shaw as a method of "digital fingerprinting" which prevents a coalition of a specified size from framing a user not in the coalition. In this presentation, the speaker will discuss a combinatorial formulation of the problem, due to Stinson and Wei, in terms of extremal set systems.
He will also consider two other problems, namely key distribution patterns and non-adaptive group testing algorithms, approaching these problems from the point of view of extremal set systems, and describing a natural common setting in which these two problems are complementary special cases.
Finally, he will discuss the (perhaps surprising) connection of these problems to frameproof codes.Douglas R. Stinson