2009 |
13 | EE | Yevgeniy Dodis,
Thomas Ristenpart,
Thomas Shrimpton:
Salvaging Merkle-Damgård for Practical Applications.
EUROCRYPT 2009: 371-388 |
12 | EE | John Black,
Martin Cochran,
Thomas Shrimpton:
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions.
J. Cryptology 22(3): 311-329 (2009) |
2008 |
11 | EE | Thomas Shrimpton,
Martijn Stam:
Building a Collision-Resistant Compression Function from Non-compressing Primitives.
ICALP (2) 2008: 643-654 |
2007 |
10 | EE | Elena Andreeva,
Gregory Neven,
Bart Preneel,
Thomas Shrimpton:
Seven-Property-Preserving Iterated Hashing: ROX.
ASIACRYPT 2007: 130-146 |
9 | EE | Thomas Ristenpart,
Thomas Shrimpton:
How to Build a Hash Function from Any Collision-Resistant Function.
ASIACRYPT 2007: 147-163 |
8 | EE | Suresh Singh,
Thomas Shrimpton:
Verifying Delivered QoS in Multihop Wireless Networks.
IEEE Trans. Mob. Comput. 6(12): 1370-1383 (2007) |
2006 |
7 | EE | Phillip Rogaway,
Thomas Shrimpton:
A Provable-Security Treatment of the Key-Wrap Problem.
EUROCRYPT 2006: 373-390 |
6 | EE | Philip D. MacKenzie,
Thomas Shrimpton,
Markus Jakobsson:
Threshold Password-Authenticated Key Exchange.
J. Cryptology 19(1): 27-66 (2006) |
2005 |
5 | EE | John Black,
Martin Cochran,
Thomas Shrimpton:
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions.
EUROCRYPT 2005: 526-541 |
2004 |
4 | EE | Phillip Rogaway,
Thomas Shrimpton:
Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance.
FSE 2004: 371-388 |
2002 |
3 | EE | John Black,
Phillip Rogaway,
Thomas Shrimpton:
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV.
CRYPTO 2002: 320-335 |
2 | EE | Philip D. MacKenzie,
Thomas Shrimpton,
Markus Jakobsson:
Threshold Password-Authenticated Key Exchange.
CRYPTO 2002: 385-400 |
1 | EE | John Black,
Phillip Rogaway,
Thomas Shrimpton:
Encryption-Scheme Security in the Presence of Key-Dependent Messages.
Selected Areas in Cryptography 2002: 62-75 |