The following pages link to Jonathan Hoch (Q321299):
Displaying 7 items.
- New second-preimage attacks on hash functions (Q321303) (← links)
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak (Q3519537) (← links)
- Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions (Q3618652) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Cryptographic Hardware and Embedded Systems - CHES 2004 (Q5311438) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Second Preimage Attacks on Dithered Hash Functions (Q5458597) (← links)
