 | 2009 |
| 18 |  | Eike Kiltz,
Krzysztof Pietrzak,
Martijn Stam,
Moti Yung:
A New Randomness Extraction Paradigm for Hybrid Encryption.
EUROCRYPT 2009: 590-609 |
| 17 |  | Martijn Stam:
Blockcipher-Based Hashing Revisited.
FSE 2009: 67-83 |
| 16 |  | Onur Özen,
Martijn Stam:
Another Glance at Double-Length Hashing.
IMA Int. Conf. 2009: 176-201 |
| 2008 |
| 15 |  | Martijn Stam:
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions.
CRYPTO 2008: 397-412 |
| 14 |  | Thomas Shrimpton,
Martijn Stam:
Building a Collision-Resistant Compression Function from Non-compressing Primitives.
ICALP (2) 2008: 643-654 |
| 2007 |
| 13 |  | Dennis Hofheinz,
John Malone-Lee,
Martijn Stam:
Obfuscation for Cryptographic Purposes.
TCC 2007: 214-232 |
| 2006 |
| 12 |  | Arjen K. Lenstra,
Dan Page,
Martijn Stam:
Discrete Logarithm Variants of VSH.
VIETCRYPT 2006: 229-242 |
| 11 |  | Sébastien Canard,
Berry Schoenmakers,
Martijn Stam,
Jacques Traoré:
List signature schemes.
Discrete Applied Mathematics 154(2): 189-201 (2006) |
| 2005 |
| 10 |  | Ronald Cramer,
Serge Fehr,
Martijn Stam:
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields.
CRYPTO 2005: 344-360 |
| 9 |  | Marten van Dijk,
Robert Granger,
Dan Page,
Karl Rubin,
Alice Silverberg,
Martijn Stam,
David P. Woodruff:
Practical Cryptography in High Dimensional Tori.
EUROCRYPT 2005: 234-250 |
| 8 |  | Martijn Stam:
A Key Encapsulation Mechanism for NTRU.
IMA Int. Conf. 2005: 410-427 |
| 7 |  | C. Dods,
Nigel P. Smart,
Martijn Stam:
Hash Based Digital Signature Schemes.
IMA Int. Conf. 2005: 96-115 |
| 6 |  | Robert Granger,
Dan Page,
Martijn Stam:
Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three.
IEEE Trans. Computers 54(7): 852-860 (2005) |
| 2004 |
| 5 |  | Robert Granger,
Dan Page,
Martijn Stam:
A Comparison of CEILIDH and XTR.
ANTS 2004: 235-249 |
| 4 |  | Dan Page,
Martijn Stam:
On XTR and Side-Channel Analysis.
Selected Areas in Cryptography 2004: 54-68 |
| 2003 |
| 3 |  | Martijn Stam:
On Montgomery-Like Representationsfor Elliptic Curves over GF(2k).
Public Key Cryptography 2003: 240-253 |
| 2002 |
| 2 |  | Martijn Stam,
Arjen K. Lenstra:
Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions.
CHES 2002: 318-332 |
| 2001 |
| 1 |  | Martijn Stam,
Arjen K. Lenstra:
Speeding Up XTR.
ASIACRYPT 2001: 125-143 |