- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c29 |      | Dimitar Jetchev, Onur Özen, Martijn Stam: Understanding Adaptivity: Random Systems Revisited. ASIACRYPT 2012: 313-330 |
| c28 | | Alexandra Boldyreva, Jean Paul Degabriele, Kenneth G. Paterson, Martijn Stam: Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation. EUROCRYPT 2012: 682-699 |
| c27 | | Dimitar Jetchev, Onur Özen, Martijn Stam: Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry. TCC 2012: 303-320 |
| 2011 | ||
| c26 | | Kenneth G. Paterson, Jacob C. N. Schuldt, Martijn Stam, Susan Thomson: On the Joint Security of Encryption and Signature, Revisited. ASIACRYPT 2011: 161-178 |
| c25 | | Frederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee, Martijn Stam, John P. Steinberger: The Preimage Security of Double-Block-Length Compression Functions. ASIACRYPT 2011: 233-251 |
| c24 | | Joppe W. Bos, Onur Özen, Martijn Stam: Efficient Hashing Using the AES Instruction Set. CHES 2011: 507-522 |
| c23 | | Jooyoung Lee, Martijn Stam, John P. Steinberger: The Collision Security of Tandem-DM in the Ideal Cipher Model. CRYPTO 2011: 561-577 |
| c22 | | |
| c21 | | Elena Andreeva, Martijn Stam: The Symbiosis between Collision and Preimage Resistance. IMA Int. Conf. 2011: 152-171 |
| i12 | | Jooyoung Lee, Martijn Stam, John P. Steinberger: The preimage security of double-block-length compression functions. IACR Cryptology ePrint Archive 2011: 210 (2011) |
| i11 | | Kenneth G. Paterson, Jacob C. N. Schuldt, Martijn Stam, Susan Thomson: On the Joint Security of Encryption and Signature, Revisited. IACR Cryptology ePrint Archive 2011: 486 (2011) |
| 2010 | ||
| j4 | | Dennis Hofheinz, John Malone-Lee, Martijn Stam: Obfuscation for Cryptographic Purposes. J. Cryptology 23(1): 121-168 (2010) |
| j3 | | John Black, Phillip Rogaway, Thomas Shrimpton, Martijn Stam: An Analysis of the Blockcipher-Based Hash Functions from PGV. J. Cryptology 23(4): 519-545 (2010) |
| c20 | | Onur Özen, Martijn Stam: Collision Attacks against the Knudsen-Preneel Compression Functions. ASIACRYPT 2010: 76-93 |
| c19 | | Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Thomas Shrimpton, Martijn Stam, Stefano Tessaro: Random Oracles with(out) Programmability. ASIACRYPT 2010: 303-320 |
| c18 | | Onur Özen, Thomas Shrimpton, Martijn Stam: Attacking the Knudsen-Preneel Compression Functions. FSE 2010: 94-115 |
| c17 | | Alexander W. Dent, Marc Fischlin, Mark Manulis, Martijn Stam, Dominique Schröder: Confidential Signatures and Deterministic Signcryption. Public Key Cryptography 2010: 462-479 |
| i10 | | Jooyoung Lee, Martijn Stam, John P. Steinberger: The collision security of Tandem-DM in the ideal cipher model. IACR Cryptology ePrint Archive 2010: 409 (2010) |
| i9 | | Joppe W. Bos, Onur Özen, Martijn Stam: Efficient Hashing using the AES Instruction Set. IACR Cryptology ePrint Archive 2010: 576 (2010) |
| 2009 | ||
| c16 | | Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung: A New Randomness Extraction Paradigm for Hybrid Encryption. EUROCRYPT 2009: 590-609 |
| c15 | | |
| c14 | | |
| i8 | | Alexander W. Dent, Marc Fischlin, Mark Manulis, Martijn Stam, Dominique Schröder: Confidential Signatures and Deterministic Signcryption. IACR Cryptology ePrint Archive 2009: 588 (2009) |
| 2008 | ||
| c13 | | Martijn Stam: Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions. CRYPTO 2008: 397-412 |
| c12 | | Thomas Shrimpton, Martijn Stam: Building a Collision-Resistant Compression Function from Non-compressing Primitives. ICALP (2) 2008: 643-654 |
| i7 | | |
| i6 | | Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung: A New Randomness Extraction Paradigm for Hybrid Encryption. IACR Cryptology ePrint Archive 2008: 304 (2008) |
| 2007 | ||
| c11 | | Dennis Hofheinz, John Malone-Lee, Martijn Stam: Obfuscation for Cryptographic Purposes. TCC 2007: 214-232 |
| i5 | | Thomas Shrimpton, Martijn Stam: Building a Collision-Resistant Compression Function from Non-Compressing Primitives. IACR Cryptology ePrint Archive 2007: 409 (2007) |
| 2006 | ||
| j2 | | Sébastien Canard, Berry Schoenmakers, Martijn Stam, Jacques Traoré: List signature schemes. Discrete Applied Mathematics 154(2): 189-201 (2006) |
| c10 | | Arjen K. Lenstra, Dan Page, Martijn Stam: Discrete Logarithm Variants of VSH. VIETCRYPT 2006: 229-242 |
| i4 | | Dennis Hofheinz, John Malone-Lee, Martijn Stam: Obfuscation for Cryptographic Purposes. IACR Cryptology ePrint Archive 2006: 463 (2006) |
| 2005 | ||
| j1 | | 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) |
| c9 | | Ronald Cramer, Serge Fehr, Martijn Stam: Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields. CRYPTO 2005: 344-360 |
| c8 | | 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 |
| c7 | | C. Dods, Nigel P. Smart, Martijn Stam: Hash Based Digital Signature Schemes. IMA Int. Conf. 2005: 96-115 |
| c6 | | |
| 2004 | ||
| c5 | | |
| c4 | | Dan Page, Martijn Stam: On XTR and Side-Channel Analysis. Selected Areas in Cryptography 2004: 54-68 |
| i3 | | Robert Granger, Dan Page, Martijn Stam: On Small Characteristic Algebraic Tori in Pairing-Based Cryptography. IACR Cryptology ePrint Archive 2004: 132 (2004) |
| i2 | | Robert Granger, Dan Page, Martijn Stam: Hardware and Software Normal Basis Arithmetic for Pairing Based Cryptography in Characteristic Three. IACR Cryptology ePrint Archive 2004: 157 (2004) |
| i1 | | Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff: Practical Cryptography in High Dimensional Tori. IACR Cryptology ePrint Archive 2004: 352 (2004) |
| 2003 | ||
| c3 | | Martijn Stam: On Montgomery-Like Representationsfor Elliptic Curves over GF(2k). Public Key Cryptography 2003: 240-253 |
| 2002 | ||
| c2 | | Martijn Stam, Arjen K. Lenstra: Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions. CHES 2002: 318-332 |
| 2001 | ||
| c1 | | |
Data released under the ODC-BY 1.0 license — See also our legal information page