Abstract
A robust multi-property combiner for a set of security properties merges two hash functions such that the resulting function satisfies each of the properties which at least one of the two starting functions has. Fischlin and Lehmann (TCC 2008) recently constructed a combiner which simultaneously preserves collision-resistance, target collision-resistance, message authentication, pseudorandomness and indifferentiability from a random oracle (IRO). Their combiner produces outputs of 5n bits, where n denotes the output length of the underlying hash functions.
In this paper we propose improved combiners with shorter outputs. By sacrificing the indifferentiability from random oracles we obtain a combiner which preserves all of the other aforementioned properties but with output length 2n only. This matches a lower bound for black-box combiners for collision-resistance as the only property, showing that the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the IRO property, slightly increasing the output length to 2nā+āĻ(logn). Finally, we show that a twist on our combiners also makes them robust for one-wayness (but at the price of a fixed input length).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.Ā 4004, pp. 409ā426. Springer, Heidelberg (2006)
Boneh, D., Boyen, X.: On the impossibility of efficiently combining collision resistant hash functions. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.Ā 4117, pp. 570ā583. Springer, Heidelberg (2006)
Fischlin, M., Lehmann, A.: Multi-property preserving combiners for hash functions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.Ā 4948, pp. 375ā392. Springer, Heidelberg (2008)
Herzberg, A.: On tolerant cryptographic constructions. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.Ā 3376, pp. 172ā190. Springer, Heidelberg (2005)
Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on ComputingĀ 17(2), 373ā386 (1988)
Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol.Ā 2951, pp. 21ā39. Springer, Heidelberg (2004)
Pietrzak, K.: Non-trivial black-box combiners for collision-resistant hash-functions donāt exist. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.Ā 4515. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
Ā© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischlin, M., Lehmann, A., Pietrzak, K. (2008). Robust Multi-property Combiners for Hash Functions Revisited. In: Aceto, L., DamgĆ„rd, I., Goldberg, L.A., HalldĆ³rsson, M.M., IngĆ³lfsdĆ³ttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70583-3_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-70583-3_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70582-6
Online ISBN: 978-3-540-70583-3
eBook Packages: Computer ScienceComputer Science (R0)