2016 search results - page 212 / 404 » Megamaps: Construction and Examples |
166
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
184
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
151
click to vote
PPDP
2009
Springer
16 years 1 months ago
2009
Springer
Several recent language designs have offered a unified language for programming a distributed system, with explicit notation of locations; we call these “location-aware” lan...
196
click to vote
SACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complementation of whole registers turns out to be very useful for constructing...
206
click to vote
ICIC
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Using the classical Parzen window (PW) estimate as the target function, the sparse kernel density estimator is constructed in a forward constrained regression manner. The...