397 search results - page 28 / 80 » Pseudorandom Functions and Lattices |
155
click to vote
EUROCRYPT
2010
Springer
15 years 6 months ago
2010
Springer
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
111
click to vote
ICIP
2002
IEEE
16 years 2 months ago
2002
IEEE
Resampling techniques are commonly required in digital image processing systems. Many times the classical interpolation functions are used, i.e., nearest-neighbour interpolation a...
107
click to vote
CCS
2008
ACM
15 years 3 months ago
2008
ACM
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...
171
click to vote
COMBINATORICA
2011
14 years 1 months ago
2011
Let L be a finite distributive lattice and µ : L → R+ a logsupermodular function. For functions k : L → R+ let Eµ(k; q) def = x∈L k(x)µ(x)qrank(x) ∈ R+ [q]. We prove fo...
139
click to vote
DKE
2002
15 years 1 months ago
2002
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...