721 search results - page 88 / 145 » Almost universal graphs |
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have propo...
COCO
2009
Springer
14 years 1 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
DAS
2006
Springer
14 years 1 months ago
2006
Springer
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that complete contains the shape. The best-fit bounding...
CRYPTO
2006
Springer
13 years 12 months ago
2006
Springer
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent...
LREC
2008
13 years 11 months ago
2008
Nowadays, there are hundreds of Natural Language Processing applications and resources for different languages that are developed and/or used, almost exclusively with a few but no...