default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartijn Stam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j11]Nicolas Costes, Martijn Stam:
Pincering SKINNY by Exploiting Slow Diffusion Enhancing Differential Power Analysis with Cluster Graph Inference. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(4): 460-492 (2023)- 2021
- [j10]Nicolas Costes, Martijn Stam:
Redundant Code-based Masking Revisited. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1): 426-450 (2021) - 2017
- [j9]Jooyoung Lee, Martijn Stam, John P. Steinberger:
The Security of Tandem-DM in the Ideal Cipher Model. J. Cryptol. 30(2): 495-518 (2017) - [j8]Elena Andreeva, Guy Barwell, Ritam Bhaumik, Mridul Nandi, Dan Page, Martijn Stam:
Turning Online Ciphers Off. IACR Trans. Symmetric Cryptol. 2017(2): 105-142 (2017) - [j7]Dragos Rotaru, Nigel P. Smart, Martijn Stam:
Modes of Operation Suitable for Computing on Encrypted Data. IACR Trans. Symmetric Cryptol. 2017(3): 294-324 (2017) - 2015
- [j6]Jooyoung Lee, Martijn Stam:
MJH: a faster alternative to MDC-2. Des. Codes Cryptogr. 76(2): 179-205 (2015) - 2010
- [j5]Dennis Hofheinz, John Malone-Lee, Martijn Stam:
Obfuscation for Cryptographic Purposes. J. Cryptol. 23(1): 121-168 (2010) - [j4]John Black, Phillip Rogaway, Thomas Shrimpton, Martijn Stam:
An Analysis of the Blockcipher-Based Hash Functions from PGV. J. Cryptol. 23(4): 519-545 (2010) - 2006
- [j3]Sébastien Canard, Berry Schoenmakers, Martijn Stam, Jacques Traoré:
List signature schemes. Discret. Appl. Math. 154(2): 189-201 (2006) - [j2]Robert Granger, Dan Page, Martijn Stam:
On Small Characteristic Algebraic Tori in Pairing-Based Cryptography. LMS J. Comput. Math. 9: 64-85 (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)
Conference and Workshop Papers
- 2024
- [c49]Carlo Brunetta
, Hans Heum, Martijn Stam:
SoK: Public Key Encryption with Openings. Public Key Cryptography (4) 2024: 35-68 - 2023
- [c48]Alessandro Melloni, Martijn Stam, Øyvind Ytrehus:
Dynamic Security Aspects of Onion Routing. IMACC 2023: 243-262 - [c47]Carlo Brunetta, Hans Heum, Martijn Stam:
Multi-instance Secure Public-Key Encryption. Public Key Cryptography (2) 2023: 336-367 - 2021
- [c46]Hans Heum, Martijn Stam:
Tightness Subtleties for Multi-user PKE Notions. IMACC 2021: 75-104 - [c45]Alessandro Melloni, Martijn Stam, Øyvind Ytrehus:
On Evaluating Anonymity of Onion Routing. SAC 2021: 3-24 - 2020
- [c44]Martha Norberg Hovd, Martijn Stam:
Vetted Encryption. INDOCRYPT 2020: 488-507 - 2018
- [c43]Jean Paul Degabriele, Martijn Stam:
Untagging Tor: A Formal Treatment of Onion Encryption. EUROCRYPT (3) 2018: 259-293 - [c42]Joppe W. Bos, Simon Friedberger, Marco Martinoli, Elisabeth Oswald, Martijn Stam:
Assessing the Feasibility of Single Trace Power Analysis of Frodo. SAC 2018: 216-234 - 2017
- [c41]Guy Barwell, Daniel P. Martin, Elisabeth Oswald, Martijn Stam:
Authenticated Encryption in the Face of Protocol and Side Channel Leakage. ASIACRYPT (1) 2017: 693-723 - [c40]Tibor Jager, Martijn Stam, Ryan Stanley-Oakes, Bogdan Warinschi:
Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. TCC (1) 2017: 409-441 - 2016
- [c39]Daniel P. Martin, Luke Mather, Elisabeth Oswald, Martijn Stam:
Characterisation and Estimation of the Key Rank Distribution in the Context of Side Channel Evaluations. ASIACRYPT (1) 2016: 548-572 - [c38]Thomas Shrimpton, Martijn Stam, Bogdan Warinschi:
A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case. CRYPTO (1) 2016: 277-307 - [c37]Yevgeniy Dodis, Martijn Stam, John P. Steinberger, Tianren Liu:
Indifferentiability of Confusion-Diffusion Networks. EUROCRYPT (2) 2016: 679-704 - 2015
- [c36]Daniel P. Martin, Jonathan F. O'Connell, Elisabeth Oswald, Martijn Stam:
Counting Keys in Parallel After a Side Channel Attack. ASIACRYPT (2) 2015: 313-337 - [c35]Guy Barwell, Daniel Page, Martijn Stam:
Rogue Decryption Failures: Reconciling AE Robustness Notions. IMACC 2015: 94-111 - [c34]Daniel P. Martin, Elisabeth Oswald, Martijn Stam, Marcin Wójcik:
A Leakage Resilient MAC. IMACC 2015: 295-310 - 2014
- [c33]Jake Longo, Daniel P. Martin, Elisabeth Oswald, Daniel Page, Martijn Stam, Michael Tunstall:
Simulatable Leakage: Analysis, Pitfalls, and New Constructions. ASIACRYPT (1) 2014: 223-242 - [c32]Gareth T. Davies, Martijn Stam:
KDM Security in the Hybrid Framework. CT-RSA 2014: 461-480 - 2013
- [c31]Paul Baecher, Pooya Farshim, Marc Fischlin, Martijn Stam:
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions. EUROCRYPT 2013: 426-443 - [c30]Alexandra Boldyreva, Jean Paul Degabriele, Kenneth G. Paterson, Martijn Stam:
On Symmetric Encryption with Distinguishable Decryption Failures. FSE 2013: 367-390 - 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]Jooyoung Lee, Martijn Stam:
MJH: A Faster Alternative to MDC-2. CT-RSA 2011: 213-236 - [c21]Elena Andreeva, Martijn Stam:
The Symbiosis between Collision and Preimage Resistance. IMACC 2011: 152-171 - 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 - 2009
- [c16]Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung:
A New Randomness Extraction Paradigm for Hybrid Encryption. EUROCRYPT 2009: 590-609 - [c15]Martijn Stam:
Blockcipher-Based Hashing Revisited. FSE 2009: 67-83 - [c14]Onur Özen, Martijn Stam:
Another Glance at Double-Length Hashing. IMACC 2009: 176-201 - 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 - 2007
- [c11]Dennis Hofheinz, John Malone-Lee, Martijn Stam:
Obfuscation for Cryptographic Purposes. TCC 2007: 214-232 - 2006
- [c10]Arjen K. Lenstra, Dan Page, Martijn Stam:
Discrete Logarithm Variants of VSH. VIETCRYPT 2006: 229-242 - 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. IMACC 2005: 96-115 - [c6]Martijn Stam:
A Key Encapsulation Mechanism for NTRU. IMACC 2005: 410-427 - 2004
- [c5]Robert Granger, Dan Page, Martijn Stam:
A Comparison of CEILIDH and XTR. ANTS 2004: 235-249 - [c4]Dan Page, Martijn Stam:
On XTR and Side-Channel Analysis. Selected Areas in Cryptography 2004: 54-68 - 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]Martijn Stam, Arjen K. Lenstra:
Speeding Up XTR. ASIACRYPT 2001: 125-143
Editorship
- 2023
- [e6]Carmit Hazay, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part I. Lecture Notes in Computer Science 14004, Springer 2023, ISBN 978-3-031-30544-3 [contents] - [e5]Carmit Hazay, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part II. Lecture Notes in Computer Science 14005, Springer 2023, ISBN 978-3-031-30616-7 [contents] - [e4]Carmit Hazay, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III. Lecture Notes in Computer Science 14006, Springer 2023, ISBN 978-3-031-30619-8 [contents] - [e3]Carmit Hazay, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part IV. Lecture Notes in Computer Science 14007, Springer 2023, ISBN 978-3-031-30633-4 [contents] - [e2]Carmit Hazay, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part V. Lecture Notes in Computer Science 14008, Springer 2023, ISBN 978-3-031-30588-7 [contents] - 2013
- [e1]Martijn Stam:
Cryptography and Coding - 14th IMA International Conference, IMACC 2013, Oxford, UK, December 17-19, 2013. Proceedings. Lecture Notes in Computer Science 8308, Springer 2013, ISBN 978-3-642-45238-3 [contents]
Informal and Other Publications
- 2023
- [i38]Carlo Brunetta, Hans Heum, Martijn Stam:
SoK: Public Key Encryption with Openings. IACR Cryptol. ePrint Arch. 2023: 1337 (2023) - [i37]Alessandro Melloni, Martijn Stam, Øyvind Ytrehus:
Dynamic Security Aspects of Onion Routing. IACR Cryptol. ePrint Arch. 2023: 1439 (2023) - 2022
- [i36]Hans Heum, Martijn Stam:
Tightness Subtleties for Multi-user PKE Notions. IACR Cryptol. ePrint Arch. 2022: 855 (2022) - [i35]Carlo Brunetta, Hans Heum, Martijn Stam:
Multi-Instance Secure Public-Key Encryption. IACR Cryptol. ePrint Arch. 2022: 909 (2022) - 2021
- [i34]Martijn Stam:
XTR and Tori. IACR Cryptol. ePrint Arch. 2021: 1659 (2021) - 2020
- [i33]Martha Norberg Hovd, Martijn Stam:
Vetted Encryption. IACR Cryptol. ePrint Arch. 2020: 1348 (2020) - 2018
- [i32]Jean Paul Degabriele, Martijn Stam:
Untagging Tor: A Formal Treatment of Onion Encryption. IACR Cryptol. ePrint Arch. 2018: 162 (2018) - [i31]Joppe W. Bos, Simon Friedberger, Marco Martinoli, Elisabeth Oswald, Martijn Stam:
Assessing the Feasibility of Single Trace Power Analysis of Frodo. IACR Cryptol. ePrint Arch. 2018: 687 (2018) - [i30]Joppe W. Bos, Simon Friedberger, Marco Martinoli, Elisabeth Oswald, Martijn Stam:
Fly, you fool! Faster Frodo for the ARM Cortex-M4. IACR Cryptol. ePrint Arch. 2018: 1116 (2018) - 2017
- [i29]Guy Barwell, Daniel P. Martin, Elisabeth Oswald, Martijn Stam:
Authenticated Encryption in the Face of Protocol and Side Channel Leakage. IACR Cryptol. ePrint Arch. 2017: 68 (2017) - [i28]Tibor Jager, Martijn Stam, Ryan Stanley-Oakes, Bogdan Warinschi:
Multi-Key Authenticated Encryption with Corruptions: Reductions are Lossy. IACR Cryptol. ePrint Arch. 2017: 495 (2017) - [i27]Dragos Rotaru, Nigel P. Smart, Martijn Stam:
Modes of Operation Suitable for Computing on Encrypted Data. IACR Cryptol. ePrint Arch. 2017: 496 (2017) - 2016
- [i26]Daniel P. Martin, Luke Mather, Elisabeth Oswald, Martijn Stam:
Characterisation and Estimation of the Key Rank Distribution in the Context of Side Channel Evaluations. IACR Cryptol. ePrint Arch. 2016: 491 (2016) - [i25]Thomas Shrimpton, Martijn Stam, Bogdan Warinschi:
A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case. IACR Cryptol. ePrint Arch. 2016: 586 (2016) - [i24]Jake Longo, Daniel P. Martin, Luke Mather, Elisabeth Oswald, Benjamin Sach, Martijn Stam:
How low can you go? Using side-channel data to enhance brute-force key recovery. IACR Cryptol. ePrint Arch. 2016: 609 (2016) - 2015
- [i23]Alexandra Boldyreva, Jean Paul Degabriele, Kenneth G. Paterson, Martijn Stam:
Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation. IACR Cryptol. ePrint Arch. 2015: 59 (2015) - [i22]Elena Andreeva, Guy Barwell, Dan Page, Martijn Stam:
Turning Online Ciphers Off. IACR Cryptol. ePrint Arch. 2015: 485 (2015) - [i21]Yevgeniy Dodis, Tianren Liu, Martijn Stam, John P. Steinberger:
Indifferentiability of Confusion-Diffusion Networks. IACR Cryptol. ePrint Arch. 2015: 680 (2015) - [i20]Daniel P. Martin, Jonathan F. O'Connell, Elisabeth Oswald, Martijn Stam:
How to Enumerate Your Keys Accurately and Efficiently After a Side Channel Attack. IACR Cryptol. ePrint Arch. 2015: 689 (2015) - [i19]Guy Barwell, Dan Page, Martijn Stam:
Rogue Decryption Failures: Reconciling AE Robustness Notions. IACR Cryptol. ePrint Arch. 2015: 895 (2015) - 2014
- [i18]Jooyoung Lee, Martijn Stam:
MJH: A Faster Alternative to MDC-2. IACR Cryptol. ePrint Arch. 2014: 108 (2014) - [i17]Jake Longo Galea, Daniel P. Martin, Elisabeth Oswald, Daniel Page, Martijn Stam:
Making and Breaking Leakage Simulators. IACR Cryptol. ePrint Arch. 2014: 357 (2014) - 2013
- [i16]Daniel P. Martin, Elisabeth Oswald, Martijn Stam:
A Leakage Resilient MAC. IACR Cryptol. ePrint Arch. 2013: 292 (2013) - [i15]Paul Baecher, Pooya Farshim, Marc Fischlin, Martijn Stam:
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions. IACR Cryptol. ePrint Arch. 2013: 350 (2013) - [i14]Alexandra Boldyreva, Jean Paul Degabriele, Kenneth G. Paterson, Martijn Stam:
On Symmetric Encryption with Distinguishable Decryption Failures. IACR Cryptol. ePrint Arch. 2013: 433 (2013) - [i13]Gareth T. Davies, Martijn Stam:
KDM Security in the Hybrid Framework. IACR Cryptol. ePrint Arch. 2013: 567 (2013) - 2011
- [i12]Jooyoung Lee, Martijn Stam, John P. Steinberger:
The preimage security of double-block-length compression functions. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2011: 486 (2011) - 2010
- [i10]Jooyoung Lee, Martijn Stam, John P. Steinberger:
The collision security of Tandem-DM in the ideal cipher model. IACR Cryptol. ePrint Arch. 2010: 409 (2010) - [i9]Joppe W. Bos, Onur Özen, Martijn Stam:
Efficient Hashing using the AES Instruction Set. IACR Cryptol. ePrint Arch. 2010: 576 (2010) - 2009
- [i8]Alexander W. Dent, Marc Fischlin, Mark Manulis, Martijn Stam, Dominique Schröder:
Confidential Signatures and Deterministic Signcryption. IACR Cryptol. ePrint Arch. 2009: 588 (2009) - 2008
- [i7]Martijn Stam:
Blockcipher Based Hashing Revisited. IACR Cryptol. ePrint Arch. 2008: 71 (2008) - [i6]Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung:
A New Randomness Extraction Paradigm for Hybrid Encryption. IACR Cryptol. ePrint Arch. 2008: 304 (2008) - 2007
- [i5]Thomas Shrimpton, Martijn Stam:
Building a Collision-Resistant Compression Function from Non-Compressing Primitives. IACR Cryptol. ePrint Arch. 2007: 409 (2007) - 2006
- [i4]Dennis Hofheinz, John Malone-Lee, Martijn Stam:
Obfuscation for Cryptographic Purposes. IACR Cryptol. ePrint Arch. 2006: 463 (2006) - 2004
- [i3]Robert Granger, Dan Page, Martijn Stam:
On Small Characteristic Algebraic Tori in Pairing-Based Cryptography. IACR Cryptol. ePrint Arch. 2004: 132 (2004) - [i2]Robert Granger, Dan Page, Martijn Stam:
Hardware and Software Normal Basis Arithmetic for Pairing Based Cryptography in Characteristic Three. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2004: 352 (2004)
Coauthor Index
Dan Page
aka: Daniel Page
aka: Daniel Page
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
