On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations

Nir Bitansky; Akshay Degwekar

doi:10.1007/978-3-030-36030-6_17

On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations

Nir Bitansky^*, Akshay Degwekar

^*Corresponding author for this work

School of Computer Science

Massachusetts Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 Scopus citations

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.

Original language	English
Title of host publication	Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings
Editors	Dennis Hofheinz, Alon Rosen
Publisher	Springer
Pages	422-450
Number of pages	29
ISBN (Print)	9783030360290
DOIs	https://doi.org/10.1007/978-3-030-36030-6_17
State	Published - 2019
Event	17th International Conference on Theory of Cryptography, TCC 2019 - Nuremberg, Germany Duration: 1 Dec 2019 → 5 Dec 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11891 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	17th International Conference on Theory of Cryptography, TCC 2019
Country/Territory	Germany
City	Nuremberg
Period	1/12/19 → 5/12/19

Funding

Funders	Funder number
Alon Young Faculty Fellowship
U.S. Army Research Office	W911NF-15-C-0236, W911NF-15-C-0226
National Science Foundation	CNS-1413920, CNS-1350619
Air Force Office of Scientific Research	FA9550-17-1-0069
Defense Advanced Research Projects Agency
Blavatnik Family Foundation
Israel Science Foundation	18/484, 1861/16

Access to Document

10.1007/978-3-030-36030-6_17

Cite this

Bitansky, N., & Degwekar, A. (2019). On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. In D. Hofheinz, & A. Rosen (Eds.), Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings (pp. 422-450). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11891 LNCS). Springer. https://doi.org/10.1007/978-3-030-36030-6_17

Bitansky, Nir ; Degwekar, Akshay. / On the Complexity of Collision Resistant Hash Functions : New and Old Black-Box Separations. Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings. editor / Dennis Hofheinz ; Alon Rosen. Springer, 2019. pp. 422-450 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0e9ad6bec78645d4bf9fb7bd0462b1c8,

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 = "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)",

publisher = "Springer",

pages = "422--450",

editor = "Dennis Hofheinz and Alon Rosen",

booktitle = "Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings",

}

Bitansky, N & Degwekar, A 2019, On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. in D Hofheinz & A Rosen (eds), Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11891 LNCS, Springer, pp. 422-450, 17th International Conference on Theory of Cryptography, TCC 2019, Nuremberg, Germany, 1/12/19. https://doi.org/10.1007/978-3-030-36030-6_17

On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. / Bitansky, Nir; Degwekar, Akshay.
Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings. ed. / Dennis Hofheinz; Alon Rosen. Springer, 2019. p. 422-450 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11891 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the Complexity of Collision Resistant Hash Functions

T2 - 17th International Conference on Theory of Cryptography, TCC 2019

AU - Bitansky, Nir

AU - Degwekar, Akshay

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85076985101&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-36030-6_17

DO - 10.1007/978-3-030-36030-6_17

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85076985101

SN - 9783030360290

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

SP - 422

EP - 450

BT - Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings

A2 - Hofheinz, Dennis

A2 - Rosen, Alon

PB - Springer

Y2 - 1 December 2019 through 5 December 2019

ER -

Bitansky N, Degwekar A. On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. In Hofheinz D, Rosen A, editors, Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings. Springer. 2019. p. 422-450. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-36030-6_17

On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this