 | 2008 |
|---|
| 10 |       | 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: 270-288 |
| 9 | | Jonathan J. Hoch,
Adi Shamir:
On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak.
ICALP (2) 2008: 616-630 |
| 8 | | Iftach Haitner,
Jonathan J. Hoch,
Gil Segev:
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
TCC 2008: 445-464 |
| 7 | | Jonathan J. Hoch,
Adi Shamir:
On the Strength of the Concatenated Hash Combiner when All the Hash Functions are Weak.
IACR Cryptology ePrint Archive 2008: 75 (2008) |
| 2007 |
|---|
| 6 | | 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: 669-679 |
| 5 | | 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.
Electronic Colloquium on Computational Complexity (ECCC) 14(038): (2007) |
| 4 | | 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 Cryptology ePrint Archive 2007: 145 (2007) |
| 3 | | Iftach Haitner,
Jonathan J. Hoch,
Gil Segev:
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
IACR Cryptology ePrint Archive 2007: 351 (2007) |
| 2006 |
|---|
| 2 | | Jonathan J. Hoch,
Adi Shamir:
Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions.
FSE 2006: 179-194 |
| 2004 |
|---|
| 1 | | Jonathan J. Hoch,
Adi Shamir:
Fault Analysis of Stream Ciphers.
CHES 2004: 240-253 |
Data released under the ODC-BY 1.0 license — See also our legal information page