In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
Sanjit Chatterjee, Darrel Hankerson, Edward Knapp,...
Two ways of constructing maximal sets of mutually orthogonal Latin squares are presented. The first construction uses maximal partial spreads in PG(3, 4)\ PG(3, 2) with r lines, wh...
Patrick Govaerts, Dieter Jungnickel, Leo Storme, J...
—This paper introduces a new high-rate analysis of the multiple description scalar quantizer (MDSQ) with balanced descriptions. The analysis provides insight into the structure o...
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...