@inproceedings{1813a99028d549a781a753ed3b31b422,
title = "On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations",
abstract = "The complexity of collision-resistant hash functions has been long studied in the theory of cryptography. While we often think about them as a Minicrypt primitive, black-box separations demonstrate that constructions from one-way functions are unlikely. Indeed, theoretical constructions of collision-resistant hash functions are based on rather structured assumptions. We make two contributions to this study: 1.A New Separation: We show that collision-resistant hashing does not imply hard problems in the class Statistical Zero Knowledge in a black-box way.2.New Proofs: We show new proofs for the results of Simon, ruling out black-box reductions of collision-resistant hashing to one-way permutations, and of Asharov and Segev, ruling out black-box reductions to indistinguishability obfuscation. The new proofs are quite different from the previous ones and are based on simple coupling arguments.",
author = "Nir Bitansky and Akshay Degwekar",
note = "Publisher Copyright: {\textcopyright} 2019, International Association for Cryptologic Research.; 17th International Conference on Theory of Cryptography, TCC 2019 ; Conference date: 01-12-2019 Through 05-12-2019",
year = "2019",
doi = "https://doi.org/10.1007/978-3-030-36030-6_17",
language = "الإنجليزيّة",
isbn = "9783030360290",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "422--450",
editor = "Dennis Hofheinz and Alon Rosen",
booktitle = "Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings",
}