Fault Analysis of Stream Ciphers. - Jonathan J. Hoch; Adi Shamir (CHES, 2004)

Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions. - Jonathan J. Hoch; Adi Shamir (FSE, 2006)

Finding Collisions in Interactive Protocols – A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. - Iftach Haitner; Jonathan J. Hoch; Omer Reingold; Gil Segev 001 (Electron. Colloquium Comput. Complex., 2007)

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. - Iftach Haitner; Jonathan J. Hoch; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2007)

Second Preimage Attacks on Dithered Hash Functions. - Elena Andreeva 001; Charles Bouillaguet; Pierre-Alain Fouque; Jonathan J. Hoch; John Kelsey; Adi Shamir; Sébastien Zimmer (EUROCRYPT, 2008)

On the Strength of the Concatenated Hash Combiner when All the Hash Functions are Weak. - Jonathan J. Hoch; Adi Shamir (IACR Cryptol. ePrint Arch., 2008)

Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. - Iftach Haitner; Jonathan J. Hoch; Omer Reingold; Gil Segev 001 (SIAM J. Comput., 2015)

New Second-Preimage Attacks on Hash Functions. - Elena Andreeva 001; Charles Bouillaguet; Orr Dunkelman; Pierre-Alain Fouque; Jonathan J. Hoch; John Kelsey; Adi Shamir; Sébastien Zimmer (J. Cryptol., 2016)