Common Contracts
1 similar null contracts
PDF hosted at the Radboud Repository of the Radboud University NijmegenJanuary 23rd, 2018
The first part of the bound of Theorem 7 is identical to that of Theorem 6, and the comments on tightness carry over. The second part of the bound comes from the bounding of Δ(Y f ,Y ), and in this bounding we use the estimation ai,j 2n−m γ, which is non-tight for most of the choices for (i, j). We see no way of attacking the scheme with query complexity around (2n−m/γ)2, but it is reasonable to assume that the security degrades with the bias in the balancedness of post.
