We introduce the block intersection polynomial, which is constructed using certain information about a block design with respect to a subset S of its point-set, and then provides further information about the number of blocks intersecting S in exactly i points, for i = 0, . . . , |S|. We also discuss some applications of block intersection polynomials, including bounding the multiplicity of a b...