Some observations on indifferentiability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6168 LNCS, Issue , 2010, Pages 117-134

  Fleischmann, Ewan ^a   Gorski, Michael ^a   Lucks, Stefan ^a  

^a BAUHAUS UNIVERSITY WEIMAR   (Germany)

Author keywords

hash function; ideal world models; indifferentiability framework; provably secure

Indexed keywords

ABSTRACT LEVELS; IDEAL WORLDS; INDIFFERENTIABILITY; KNUDSEN; PROVABLY SECURE; RANDOM ORACLE; SHA-3 COMPETITIONS; STRUCTURAL FLAWS;

HASH FUNCTIONS;

SECURITY OF DATA;

EID: 78649837349     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14081-5_8     Document Type: Conference Paper

References (29)

1. Andreeva, E., Bouillaguet, C., Fouque, P.-A., Hoch, J.J., Kelsey, J., Shamir, A., Zimmer, S.: Second preimage attacks on dithered hash functions. In: Smart [28], pp. 270-288
2. Bellare, M., Boldyreva, A., Palacio, A.: An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 171-188. Springer, Heidelberg (2004)
3. Bellare, M., Ristenpart, T.: Multi-property-preserving hash domain extension and the emd transform. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 299-314. Springer, Heidelberg (2006)
4. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, pp. 62-73 (1993)
5. Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the sponge construction. In: Smart [28], pp. 181-197 (2008)
6. Brassard, G. (ed.): CRYPTO 1989. LNCS, vol. 435. Springer, Heidelberg (1990)
7. Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM 51(4), 557-594 (2004)
8. Coron, J.-S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-damgård revisited: How to construct a hash function. In: Shoup [27], pp. 430-448
9. Damgård, I.: A design principle for hash functions. In: Brassard [6], pp. 416-427
10. Dodis, Y., Oliveira, R., Pietrzak, K.: On the generic insecurity of the full domain hash. In: Shoup [27], pp. 449-466
11. Dodis, Y., Ristenpart, T., Shrimpton, T.: Salvaging merkle-damgård for practical applications. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 371-388. Springer, Heidelberg (2010)
12. Fleischmann, E., Gorski, M., Lucks, S.: Some Observations on Indifferentiability. Cryptology ePrint Archive, Report 2010/264 (2010)
13. Goldwasser, S., Taumann, Y.: On the (in)security of the fiat-shamir paradigm. In: FOCS 2003, pp. 102-115. IEEE Computer Society Press, Los Alamitos (2003)
14. Joux, A.: Multicollisions in iterated hash functions. application to cascaded constructions. In: Franklin, M. K. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 306-316. Springer, Heidelberg (2004)
15. Kelsey, J., Kohno, T.: Herding hash functions and the nostradamus attack. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 183-200. Springer, Heidelberg (2006)
16. Kelsey, J., Schneier, B.: Second preimages on n-bit hash functions for much less than 2n work. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 474-490. Springer, Heidelberg (2005)
17. Knudsen, L.R.: Hash Functions and SHA-3. In: FSE 2008 (2008) (invited talk), http://fse2008.epfl.ch/docs/slides/day-1-sess-2/Knudsen-FSE2008.pdf
18. Liskov, M.: Constructing an ideal hash function from weak ideal compression functions. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol. 4356, pp. 358-375. Springer, Heidelberg (2007)
19. Maurer, U.M., 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)
20. Merkle, R.C.: One way hash functions and des. In: Brassard [6], pp. 428-446
21. Nielsen, J.B.: Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 111-126. Springer, Heidelberg (2002)
22. NIST National Institute of Standards and Technology. FIPS 180-1: Secure Hash Standard (April 1995), http://csrc.nist.gov
23. NIST National Institute of Standards and Technology. FIPS 180-2: Secure Hash Standard (April 1995), http://csrc.nist.gov
24. NIST National Institute of Standards and Technology. Tentative Timeline of the Development of New Hash Functions, http://csrc.nist.gov/pki/HashWorkshop/ timeline.html
25. Ristenpart, T., Shrimpton, T.: How to build a hash function from any collisionresistant function. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 147-163. Springer, Heidelberg (2007)
26. Rivest, R.L.: RFC 1321: The MD5 Message-Digest Algorithm. Internet Activities Board (April 1992)
27. Shoup, V. (ed.): CRYPTO 2005. LNCS, vol. 3621. Springer, Heidelberg (2005)
28. Smart, N.P. (ed.): EUROCRYPT 2008. LNCS, vol. 4965. Springer, Heidelberg (2008)
29. Stinson, D.R.: Cryptography: Theory and Practice. CRC Press, Boca Raton (1995)