Jonathan J. Hoch

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:70/3189 · DBLP profile ↗

← Back

8ranked-venue papers

3as first author

0since 2021 · last 2016

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5 · 2 first-authorTheory of computation · 4 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security

6 papers

Cryptographic primitives and cryptanalysis · 56% Cryptographic protocols and secure computation · 44% Hardware security and side channels · 1%

Topics — the 11 heaviest of 12, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis › hash function cryptanalysis second preimage attack	0.3	2	2016	New Second-Preimage Attacks on Hash Functions · J. Cryptol. 2016 Second Preimage Attacks on Dithered Hash Functions · EUROCRYPT 2008
Cryptographic protocols and secure computation commitment schemes	0.3	2	2015	Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments · SIAM J. Comput. 2015 Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments · FOCS 2007
Cryptographic protocols and secure computation › commitment schemes statistically hiding commitment	0.3	2	2015	Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments · SIAM J. Comput. 2015 Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments · FOCS 2007
Cryptographic primitives and cryptanalysis hash function cryptanalysis	0.2	1	2016	New Second-Preimage Attacks on Hash Functions · J. Cryptol. 2016
Cryptographic primitives and cryptanalysis › provable security black-box separations	0.2	1	2015	Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments · SIAM J. Comput. 2015
Cryptographic primitives and cryptanalysis hash functions	0.2	2	2008	On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak · ICALP (2) 2008 Second Preimage Attacks on Dithered Hash Functions · EUROCRYPT 2008
Cryptographic protocols and secure computation oblivious transfer	0.1	1	2007	Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments · FOCS 2007
Cryptographic protocols and secure computation private information retrieval	0.1	1	2007	Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments · FOCS 2007
Cryptographic protocols and secure computation › secure computation protocols › round complexity of secure computation round complexity lower bounds	0.1	1	2007	Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments · FOCS 2007
Cryptographic primitives and cryptanalysis › cryptanalysis fault analysis	0.0	1	2004	Fault Analysis of Stream Ciphers · CHES 2004
Hardware security and side channels fault attacks	0.0	1	2004	Fault Analysis of Stream Ciphers · CHES 2004

Methods — techniques the papers use, named apart from their topics

reconstruction paradigm · 0.3collision-finding oracle · 0.3cryptanalysis · 0.1black-box separation · 0.1

Year	Publication	Venue	Position
2016	New Second-Preimage Attacks on Hash Functions Elena Andreeva 0001, Charles Bouillaguet, Orr Dunkelman, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer	J. Cryptol.	5
2015	Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments abstract We study the round and communication complexities of various cryptographic protocols. We give tight lower bounds on the round and communication complexities of any fully black-box reduction of a statistically hiding commitment scheme from one-way permutations and from trapdoor permutations. As a corollary, we derive similar tight lower bounds for several other cryptographic protocols, such as single-server private information retrieval, interactive hashing, and oblivious transfer that guarantees statistical security for one of the parties. Our techniques extend the collision-finding oracle due to Simon [Advances in Cryptology---EUROCRYPT'98, Lecture Notes in Comput. Sci. 1403, Springer, Berlin, 1998, pp. 334--345] to the setting of interactive protocols and the reconstruction paradigm of Gennaro and Trevisan [Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS), IEEE Press, Piscataway, NJ, 2000, pp. 305--313]. Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev 0001	SIAM J. Comput.	2
2008	Second Preimage Attacks on Dithered Hash Functions Elena Andreeva 0001, Charles Bouillaguet, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer	EUROCRYPT	4
2008	On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak Jonathan J. Hoch, Adi Shamir	ICALP (2)	1
2008	A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval Iftach Haitner, Jonathan J. Hoch, Gil Segev 0001	TCC	2
2007	Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments abstract We study the round complexity of various cryptographic protocols. Our main result is a tight lower bound on the round complexity of any fully-black-box construction of a statistically-hiding commitment scheme from oneway permutations, and even front trapdoor permutations. This lower bound matches the round complexity of the statistically-hiding commitment scheme due to Naor, Ostrovsky, Venkatesan and Yung (CRYPTO '92). As a corollary, we derive similar tight lower bounds for several other ctyptographicprotocols, such as single-server private information retrieval, interactive hashing, and oblivious transfer that guarantees statistical security for one of the parties. Our techniques extend the collision-finding oracle due to Simon (EUROCRYPT '98) to the setting of interactive protocols (our extension also implies an alternative proof for the main property of the original oracle). In addition, we substantially extend the reconstruction paradigm of Gennaro and Trevisan (FOCS '00). In both cases, our extensions are quite delicate and may be found useful in proving additional black-box separation results. Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev 0001	FOCS	2
2006	Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions Jonathan J. Hoch, Adi Shamir	FSE	1
2004	Fault Analysis of Stream Ciphers Jonathan J. Hoch, Adi Shamir	CHES	1