38 search results - page 2 / 8 » How to Build a Hash Function from Any Collision-Resistant Fu... |
ACISP
2007
Springer
13 years 12 months ago
2007
Springer
We present a new non-interactive message authentication protocol in manual channel model (NIMAP, for short) using the weakest assumption on the manual channel (i.e. assuming the st...
ACISP
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a ...
ASIACRYPT
2009
Springer
14 years 11 days ago
2009
Springer
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
EUROCRYPT
2008
Springer
13 years 7 months ago
2008
Springer
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...
ESA
2006
Springer
13 years 9 months ago
2006
Springer
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...