On chosen target forced prefix preimage resistance

[1] BELLARE, M.-RISTENPART, T.: Hash functions in the dedicated-key setting: Design choices and MPP transforms, in: Automata, Languages and Programming, 34th Internat. Colloquium-ICALP ’07 (L. Arge et al., eds.), Wrocaw, Poland, 2007, Lecture Notes in Comput. Sci., Vol. 4596, Springer-Verlag, Berlin, 2007, pp. 399-410.Search in Google Scholar

[2] BELLARE, M.-RISTENPART, T.: Multi-property-preserving hash domain extension and the EMD transform, in: Advances in Cryptology-ASIACRYPT ’06, 12th Internat. Conf. on the Theory and Application of Cryptology and Information Security (X. Lai et al., eds.), Shanghai, China, 2006, Lecture Notes in Comput. Sci., Vol., 4284, Springer-Verlag, Berlin, 2006, pp. 299-314.10.1007/11935230_20Search in Google Scholar

[3] CORON, J. S.-DODIS, Y.-MALINAUD, C.-PUNIYA, P.: Merkle-Damg°ard revisited: How to construct a hash function, in: Advances in Cryptology-CRYPTO ’05, 25th Annual Internat. Cryptology Conf. (V. Shoup, ed.), Santa Barbara, CA, USA, 2005, Lecture Notes in Comput. Sci., Vol. 3621, Springer-Verlag, Berlin, 2005, pp. 430-448.Search in Google Scholar

[4] KELSEY, J.-KOHNO, T.: Herding hash functions and the Nostradamus attack, in: Ad- vances in Cryptology-EUROCRYPT ’06, 25th Annual Internat. Conf. on the Theory and Appl. of Cryptographic Techniques (S. Vaudenay, ed.), St. Petersburg, Russia, 2006, Lecture Notes in Comput. Sci., Vol. 4004, Springer-Verlag, Berlin, 2006, pp. 183-200.Search in Google Scholar

[5] MAURER, U.-RENNER, R.-HOLENSTEIN, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology, in: Theory of Cryptog- raphy, 1st Theory of Cryptography Conf.-TCC ’04 (M. Naor, ed.), Cambridge, MA, USA, 2004, Lecture Notes in Comput. Sci., Vol. 2951, Springer-Verlag, Berlin, 2004, pp. 21-39.Search in Google Scholar

[6] ROGAWAY, P.-SHRIMPTON, T.: Cryptographic hash-function basics: Definitions, im- plications, and separations for preimage resistance, second-preimage resistance, and col- lision resistance, in: Fast Software Encryption, 11th International Workshop-FSE ’04 (B. Roy et al., eds.), Delhi, India, 2004, Lecture Notes in Comput. Sci., Vol. 3017, Springer- -Verlag, Berlin, 2004, pp. 371-388.Search in Google Scholar

[7] RJAˇ SKO, M.: Properties of cryptographic hash functions, in: Mikul´aˇsska Kryptobes´ıdka, 2008, Prague, Trusted Network Solution, Prague, 2008, pp. 53-62.Search in Google Scholar