Jonathan J. Hoch

Publication Activity (10 Years)

Years Active: 2004-2021
Publications (10 Years): 2

Top Topics

Top Venues

SIAM J. Comput.

Publications

Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. CoRR (2021)
Elena Andreeva, Charles Bouillaguet, Orr Dunkelman, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer
New Second-Preimage Attacks on Hash Functions. J. Cryptol. 29 (4) (2016)
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. SIAM J. Comput. 44 (1) (2015)
Jonathan J. Hoch, Adi Shamir
On the Strength of the Concatenated Hash Combiner when All the Hash Functions are Weak. IACR Cryptol. ePrint Arch. 2008 (2008)
Jonathan J. Hoch, Adi Shamir
On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak. ICALP (2) (2008)
Iftach Haitner, Jonathan J. Hoch, Gil Segev
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. TCC (2008)
Elena Andreeva, Charles Bouillaguet, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer
Second Preimage Attacks on Dithered Hash Functions. EUROCRYPT (2008)
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. Electron. Colloquium Comput. Complex. 14 (038) (2007)
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. FOCS (2007)
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. IACR Cryptol. ePrint Arch. 2007 (2007)
Iftach Haitner, Jonathan J. Hoch, Gil Segev
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. IACR Cryptol. ePrint Arch. 2007 (2007)
Jonathan J. Hoch, Adi Shamir
Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions. FSE (2006)
Jonathan J. Hoch, Adi Shamir
Fault Analysis of Stream Ciphers. CHES (2004)