Jonathan J. Hoch

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval

Gil Segev, Iftach Haitner, Jonathan J. Hoch, 2008, TCC.

On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak

Adi Shamir, Jonathan J. Hoch, 2008, ICALP.

New Second-Preimage Attacks on Hash Functions

John Kelsey, Adi Shamir, Orr Dunkelman, 2016, Journal of Cryptology.

Fault Analysis of Stream Ciphers

Adi Shamir, Jonathan J. Hoch, A. Shamir, 2004, CHES.

Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

Omer Reingold, Gil Segev, Iftach Haitner, 2015, SIAM J. Comput..

Second Preimage Attacks on Dithered Hash Functions

John Kelsey, Adi Shamir, Pierre-Alain Fouque, 2008, EUROCRYPT.

Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments

Omer Reingold, Gil Segev, Iftach Haitner, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions

Adi Shamir, Jonathan J. Hoch, A. Shamir, 2006, FSE.