Jonathan J. Hoch

According to our database, Jonathan J. Hoch authored at least 8 papers between 2004 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

New Second-Preimage Attacks on Hash Functions.

Elena Andreeva, Charles Bouillaguet, Orr Dunkelman, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer

J. Cryptol., 2016

2015

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

SIAM J. Comput., 2015

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

Second Preimage Attacks on Dithered Hash Functions.

Elena Andreeva, Charles Bouillaguet, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer

Proceedings of the Advances in Cryptology, 2008

2007

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

Iftach Haitner, Jonathan J. Hoch, Gil Segev

IACR Cryptol. ePrint Arch., 2007

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

Electron. Colloquium Comput. Complex., 2007

2006

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

Jonathan J. Hoch, Adi Shamir

Proceedings of the Fast Software Encryption, 13th International Workshop, 2006

2004

Fault Analysis of Stream Ciphers.

Jonathan J. Hoch, Adi Shamir

Proceedings of the Cryptographic Hardware and Embedded Systems, 2004