| Fault analysis of stream ciphers JJ Hoch, A Shamir Cryptographic Hardware and Embedded Systems-CHES 2004: 6th International …, 2004 | 236 | 2004 |
| Finding collisions in interactive protocols-a tight lower bound on the round complexity of statistically-hiding commitments I Haitner, JJ Hoch, O Reingold, G Segev 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 669-679, 2007 | 103 | 2007 |
| Second preimage attacks on dithered hash functions E Andreeva, C Bouillaguet, PA Fouque, JJ Hoch, J Kelsey, A Shamir, ... Advances in Cryptology–EUROCRYPT 2008: 27th Annual International Conference …, 2008 | 98 | 2008 |
| Breaking the ICE–finding multicollisions in iterated concatenated and expanded (ICE) hash functions JJ Hoch, A Shamir Fast Software Encryption: 13th International Workshop, FSE 2006, Graz …, 2006 | 75 | 2006 |
| On the strength of the concatenated hash combiner when all the hash functions are weak JJ Hoch, A Shamir Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008 | 54 | 2008 |
| Finding collisions in interactive protocols---tight lower bounds on the round and communication complexities of statistically hiding commitments I Haitner, JJ Hoch, O Reingold, G Segev SIAM Journal on Computing 44 (1), 193-242, 2015 | 46 | 2015 |
| New second-preimage attacks on hash functions E Andreeva, C Bouillaguet, O Dunkelman, PA Fouque, J Hoch, J Kelsey, ... Journal of Cryptology 29, 657-696, 2016 | 36 | 2016 |
| A linear lower bound on the communication complexity of single-server private information retrieval I Haitner, JJ Hoch, G Segev Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008 …, 2008 | 15 | 2008 |
| Finding Collisions in Interactive Protocols--Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments I Haitner, JJ Hoch, O Reingold, G Segev arXiv preprint arXiv:2105.01417, 2021 | | 2021 |
Gil SegevProfessor of Computer Science, Hebrew UniversityVerified email at cs.stanford.edu
