|
Department of Mathematics and Computer Science |
|
|
E-mail: |
|
|
Position: |
Ph.D. student |
|
Advisor: |
Prof. Adi Shamir |
|
Office: |
Ziskind 212 |
·
Public Key
Cryptography (Spring 2007)
·
Private
Key Cryptography (Spring 2008)
· Jonathan J. Hoch and Adi Shamir, On the Strength of the Concatenated Hash Combiner when All the Hash Functions are Weak, proc. 2008 [pdf]
· Elena Andreeva, Charles Bouillaguet, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir and Sebastien Zimmer, Generic Second Preimage Attacks on Dithered Hash Functions, proc. Eurocrypt 2008 [pdf],
· Iftach Haitner, Jonathan J. Hoch and Gil Segev, A Linear Lower Bound on the Communication Complexity of Single-Server Private Information retrieval, proc. TCC 2008 [pdf]
· Iftach Haitner, Jonathan J. Hoch, Omer Reingold and Gil Segev, Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments, proc. FOCS 2007 [pdf]
· Jonathan J. Hoch and Adi Shamir, Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions, proc. FSE 2006 [pdf]
· Jonathan J. Hoch and Adi Shamir, Fault Analysis of Stream Ciphers, proc. CHES 2005 [pdf]
Presentations:
·
ICE – Given at “Hash Function Analysis” course –
Spring 2009
Preprints:
My master thesis: Fault Analysis of
Stream Ciphers [pdf]
|
Faculty of Mathematics and Computer
Science |