Jonathan J. Hoch

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