CRYPTO
2012
Springer
11 years 9 months ago
2012
Springer
Abstract. In this paper, we study the security proofs of GCM (Galois/Counter Mode of Operation). We first point out that a lemma, which is related to the upper bound on the probab...
ECCC
2010
13 years 7 months ago
2010
The rich collection of successes in property testing raises a natural question: Why are so many different properties turning out to be locally testable? Are there some broad "...
RANDOM
1998
Springer
13 years 11 months ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...