Jonathan J. Hoch
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
6
Venues
6
Active years
2004–2008
Best venue rank
A*
Where they publish
Papers
6 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2008 | EuroCrypt | Second Preimage Attacks on Dithered Hash Functions. | Elena Andreeva, Charles Bouillaguet, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sbastien Zimmer |
| 2008 | ICALP | On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak. | Jonathan J. Hoch, Adi Shamir |
| 2008 | TCC | A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. | Iftach Haitner, Jonathan J. Hoch, Gil Segev |
| 2007 | FOCS | 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 |
| 2006 | FSE | Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions. | Jonathan J. Hoch, Adi Shamir |
| 2004 | CHES | Fault Analysis of Stream Ciphers. | Jonathan J. Hoch, Adi Shamir |