106 search results - page 4 / 22 » Almost random graphs with simple hash functions |
153
click to vote
FSE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
140
click to vote
COMBINATORICS
2002
15 years 3 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
131
click to vote
CCS
2008
ACM
15 years 6 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...
151
click to vote
IACR
2011
14 years 3 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
178
click to vote
EUROCRYPT
2010
Springer
15 years 8 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...