4325 search results - page 711 / 865 » Incremental computation with names |
CRYPTO
2006
Springer
15 years 1 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...
DEXA
2006
Springer
15 years 1 months ago
2006
Springer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
COLT
2008
Springer
15 years 1 months ago
2008
Springer
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
106
click to vote
CRYPTO
2008
Springer
15 years 1 months ago
2008
Springer
The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed...