40 search results - page 5 / 8 » Some Plausible Constructions of Double-Block-Length Hash Fun... |
FROCOS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we report on a novel approach for uniform encoding of hash functions (but also other cryptographic functions) into propositional logic formulae, and reducin...
ASIACRYPT
2009
Springer
14 years 3 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
CHES
2011
Springer
12 years 8 months ago
2011
Springer
This paper proposes spongent – a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128, 160, 224, and 256 bits based on a sponge construc...
ACISP
2007
Springer
14 years 2 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 ...
ALENEX
2009
13 years 9 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...