Martijn Stam

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from SIGIR 2026 / reviewers in the wild / expert

dblp:82/4585 · DBLP profile ↗

← Back

49ranked-venue papers

5as first author

5since 2021 · last 2026

0000-0002-5319-4625ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 46 · 5 first-author · 5 since 2021Theory of computation · 5Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security 29 papers		Cryptographic primitives and cryptanalysis · 47% Network security · 40% Hardware security and side channels · 9%
Computer architecture, parallel and distributed computing, and storage systems 2 papers		Processor architecture and microarchitecture · 70% Hardware accelerators and domain-specific architectures · 30%

Topics — the 30 heaviest of 42, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Network security anonymity networks	2.3	3	2026	Secure Onion Encryption and the Case of Counter Galois Onion · EUROCRYPT 2026 Counter Galois Onion (sfCGO): Fast Non-malleable Onion Encryption for Tor · EUROCRYPT 2026 Untagging Tor: A Formal Treatment of Onion Encryption · EUROCRYPT (3) 2018
Network security › anonymity networks onion routing encryption	2.3	3	2026	Secure Onion Encryption and the Case of Counter Galois Onion · EUROCRYPT 2026 Counter Galois Onion (sfCGO): Fast Non-malleable Onion Encryption for Tor · EUROCRYPT 2026 Untagging Tor: A Formal Treatment of Onion Encryption · EUROCRYPT (3) 2018
Hardware security and side channels side-channel attack	0.8	3	2017	Authenticated Encryption in the Face of Protocol and Side Channel Leakage · ASIACRYPT (1) 2017 Characterisation and Estimation of the Key Rank Distribution in the Context of Side Channel Evaluations · ASIACRYPT (1) 2016 Counting Keys in Parallel After a Side Channel Attack · ASIACRYPT (2) 2015
Cryptographic primitives and cryptanalysis hash functions	0.7	6	2013	Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions · EUROCRYPT 2013 Efficient Hashing Using the AES Instruction Set · CHES 2011 An Analysis of the Blockcipher-Based Hash Functions from PGV · J. Cryptol. 2010
Cryptographic primitives and cryptanalysis › provable security › security notions › non-malleability non-malleable encryption	0.6	2	2026	Secure Onion Encryption and the Case of Counter Galois Onion · EUROCRYPT 2026 Counter Galois Onion (sfCGO): Fast Non-malleable Onion Encryption for Tor · EUROCRYPT 2026
Cryptographic primitives and cryptanalysis leakage-resilient cryptography	0.5	2	2017	Authenticated Encryption in the Face of Protocol and Side Channel Leakage · ASIACRYPT (1) 2017 Simulatable Leakage: Analysis, Pitfalls, and New Constructions · ASIACRYPT (1) 2014
Cryptographic primitives and cryptanalysis › hash functions › hash function constructions compression functions	0.4	4	2011	The Preimage Security of Double-Block-Length Compression Functions · ASIACRYPT 2011 Collision Attacks against the Knudsen-Preneel Compression Functions · ASIACRYPT 2010 Building a Collision-Resistant Compression Function from Non-compressing Primitives · ICALP (2) 2008
Cryptographic primitives and cryptanalysis authenticated encryption	0.3	1	2017	Authenticated Encryption in the Face of Protocol and Side Channel Leakage · ASIACRYPT (1) 2017
Cryptographic primitives and cryptanalysis block cipher cryptanalysis	0.3	1	2017	The Security of Tandem-DM in the Ideal Cipher Model · J. Cryptol. 2017
Cryptographic primitives and cryptanalysis › hash functions › hash function constructions blockcipher-based hash function	0.3	2	2013	Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions · EUROCRYPT 2013 An Analysis of the Blockcipher-Based Hash Functions from PGV · J. Cryptol. 2010
Cryptographic primitives and cryptanalysis › symmetric cryptography block cipher design	0.2	1	2016	Indifferentiability of Confusion-Diffusion Networks · EUROCRYPT (2) 2016
Cryptographic primitives and cryptanalysis provable security	0.2	2	2016	Understanding Adaptivity: Random Systems Revisited · ASIACRYPT 2012 A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case · CRYPTO (1) 2016
Hardware security and side channels › side-channel attack › power analysis differential power analysis	0.2	1	2015	Counting Keys in Parallel After a Side Channel Attack · ASIACRYPT (2) 2015
Cryptographic primitives and cryptanalysis › leakage-resilient cryptography leakage-resilient constructions	0.2	1	2014	Simulatable Leakage: Analysis, Pitfalls, and New Constructions · ASIACRYPT (1) 2014
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic models ideal cipher model	0.2	3	2017	The Security of Tandem-DM in the Ideal Cipher Model · J. Cryptol. 2017 Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions · EUROCRYPT 2013 The Collision Security of Tandem-DM in the Ideal Cipher Model · CRYPTO 2011
Cryptographic primitives and cryptanalysis symmetric cryptography	0.1	1	2012	Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation · EUROCRYPT 2012
Cryptographic primitives and cryptanalysis › hash functions AES-like hashing	0.1	1	2011	Efficient Hashing Using the AES Instruction Set · CHES 2011
Cryptographic primitives and cryptanalysis hash function cryptanalysis	0.1	1	2011	The Preimage Security of Double-Block-Length Compression Functions · ASIACRYPT 2011
Cryptographic primitives and cryptanalysis › hash functions hash function security	0.1	1	2011	The Collision Security of Tandem-DM in the Ideal Cipher Model · CRYPTO 2011
Cryptographic primitives and cryptanalysis › hash function cryptanalysis preimage attack	0.1	1	2011	The Preimage Security of Double-Block-Length Compression Functions · ASIACRYPT 2011
Cryptographic primitives and cryptanalysis › hash function cryptanalysis collision attack	0.1	1	2010	Collision Attacks against the Knudsen-Preneel Compression Functions · ASIACRYPT 2010
Cryptographic primitives and cryptanalysis obfuscation	0.1	1	2010	Obfuscation for Cryptographic Purposes · J. Cryptol. 2010
Cryptographic primitives and cryptanalysis random oracle model	0.1	1	2010	Random Oracles with(out) Programmability · ASIACRYPT 2010
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption hybrid encryption	0.1	1	2009	A New Randomness Extraction Paradigm for Hybrid Encryption · EUROCRYPT 2009
Cryptographic primitives and cryptanalysis randomness extraction	0.1	1	2009	A New Randomness Extraction Paradigm for Hybrid Encryption · EUROCRYPT 2009
Cryptographic primitives and cryptanalysis public-key cryptography	0.1	2	2005	Practical Cryptography in High Dimensional Tori · EUROCRYPT 2005 Speeding Up XTR · ASIACRYPT 2001
Cryptographic primitives and cryptanalysis › hash functions collision-resistant hash functions	0.1	1	2008	Building a Collision-Resistant Compression Function from Non-compressing Primitives · ICALP (2) 2008
Hardware security and side channels › leakage analysis side-channel evaluation	0.1	1	2016	Characterisation and Estimation of the Key Rank Distribution in the Context of Side Channel Evaluations · ASIACRYPT (1) 2016
Cryptographic primitives and cryptanalysis finite field arithmetic	0.1	1	2005	Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three · IEEE Trans. Computers 2005
Cryptographic primitives and cryptanalysis pairing-based cryptography	0.1	1	2005	Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three · IEEE Trans. Computers 2005

Methods — techniques the papers use, named apart from their topics

ideal cipher model · 0.3modular security analysis · 0.2provable security · 0.2simulation-based security · 0.2random oracle · 0.1duursma-lee algorithm · 0.1cryptographic reduction · 0.1block cipher constructions · 0.1algebraic number theory · 0.1algebraic geometry · 0.1

Year	Publication	Venue	Position
2026	Counter Galois Onion (sfCGO): Fast Non-malleable Onion Encryption for Tor Jean Paul Degabriele, Alessandro Melloni, Jean-Pierre Münch, Martijn Stam	EUROCRYPT	4
2026	Secure Onion Encryption and the Case of Counter Galois Onion Jean Paul Degabriele, Alessandro Melloni, Martijn Stam	EUROCRYPT	3
2023	Dynamic Security Aspects of Onion Routing Alessandro Melloni, Martijn Stam, Øyvind Ytrehus	IMACC	2
2021	Tightness Subtleties for Multi-user PKE Notions Hans Heum, Martijn Stam	IMACC	2
2021	On Evaluating Anonymity of Onion Routing Alessandro Melloni, Martijn Stam, Øyvind Ytrehus	SAC	2
2018	Untagging Tor: A Formal Treatment of Onion Encryption Jean Paul Degabriele, Martijn Stam	EUROCRYPT (3)	2
2018	Assessing the Feasibility of Single Trace Power Analysis of Frodo Joppe W. Bos, Simon Friedberger, Marco Martinoli, Elisabeth Oswald, Martijn Stam	SAC	5
2017	Authenticated Encryption in the Face of Protocol and Side Channel Leakage Guy Barwell, Daniel P. Martin 0001, Elisabeth Oswald, Martijn Stam	ASIACRYPT (1)	4
2017	Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy Tibor Jager, Martijn Stam, Ryan Stanley-Oakes, Bogdan Warinschi	TCC (1)	2
2017	The Security of Tandem-DM in the Ideal Cipher Model Jooyoung Lee 0001, Martijn Stam, John P. Steinberger	J. Cryptol.	2
2016	Characterisation and Estimation of the Key Rank Distribution in the Context of Side Channel Evaluations Daniel P. Martin 0001, Luke Mather, Elisabeth Oswald, Martijn Stam	ASIACRYPT (1)	4
2016	A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case Thomas Shrimpton, Martijn Stam, Bogdan Warinschi	CRYPTO (1)	2
2016	Indifferentiability of Confusion-Diffusion Networks Yevgeniy Dodis, Martijn Stam, John P. Steinberger, Tianren Liu	EUROCRYPT (2)	2
2015	Counting Keys in Parallel After a Side Channel Attack Daniel P. Martin 0001, Jonathan F. O'Connell 0001, Elisabeth Oswald, Martijn Stam	ASIACRYPT (2)	4
2015	Rogue Decryption Failures: Reconciling AE Robustness Notions Guy Barwell, Dan Page, Martijn Stam	IMACC	3
2015	A Leakage Resilient MAC Daniel P. Martin 0001, Elisabeth Oswald, Martijn Stam, Marcin Wójcik	IMACC	3
2015	MJH: a faster alternative to MDC-2 Jooyoung Lee 0001, Martijn Stam	Des. Codes Cryptogr.	2
2014	Simulatable Leakage: Analysis, Pitfalls, and New Constructions Jake Longo, Daniel P. Martin 0001, Elisabeth Oswald, Dan Page, Martijn Stam, Michael Tunstall	ASIACRYPT (1)	5
2014	KDM Security in the Hybrid Framework Gareth T. Davies, Martijn Stam	CT-RSA	2
2013	Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions Paul Baecher, Pooya Farshim, Marc Fischlin, Martijn Stam	EUROCRYPT	4
2013	On Symmetric Encryption with Distinguishable Decryption Failures Alexandra Boldyreva, Jean Paul Degabriele, Kenneth G. Paterson, Martijn Stam	FSE	4
2012	Understanding Adaptivity: Random Systems Revisited Dimitar Jetchev, Onur Özen, Martijn Stam	ASIACRYPT	3
2012	Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation Alexandra Boldyreva, Jean Paul Degabriele, Kenneth G. Paterson, Martijn Stam	EUROCRYPT	4
2012	Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry Dimitar Jetchev, Onur Özen, Martijn Stam	TCC	3
2011	The Preimage Security of Double-Block-Length Compression Functions Frederik Armknecht, Ewan Fleischmann, Matthias Krause 0001, Jooyoung Lee 0001, Martijn Stam, John P. Steinberger	ASIACRYPT	5
2011	On the Joint Security of Encryption and Signature, Revisited Kenneth G. Paterson, Jacob C. N. Schuldt, Martijn Stam, Susan Thomson 0001	ASIACRYPT	3
2011	Efficient Hashing Using the AES Instruction Set Joppe W. Bos, Onur Özen, Martijn Stam	CHES	3
2011	The Collision Security of Tandem-DM in the Ideal Cipher Model Jooyoung Lee 0001, Martijn Stam, John P. Steinberger	CRYPTO	2
2011	MJH: A Faster Alternative to MDC-2 Jooyoung Lee 0001, Martijn Stam	CT-RSA	2
2011	The Symbiosis between Collision and Preimage Resistance Elena Andreeva 0001, Martijn Stam	IMACC	2
2010	Random Oracles with(out) Programmability Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Thomas Shrimpton, Martijn Stam, Stefano Tessaro	ASIACRYPT	5
2010	Collision Attacks against the Knudsen-Preneel Compression Functions Onur Özen, Martijn Stam	ASIACRYPT	2
2010	Attacking the Knudsen-Preneel Compression Functions Onur Özen, Thomas Shrimpton, Martijn Stam	FSE	3
2010	An Analysis of the Blockcipher-Based Hash Functions from PGV John Black, Phillip Rogaway, Thomas Shrimpton, Martijn Stam	J. Cryptol.	4
2010	Obfuscation for Cryptographic Purposes Dennis Hofheinz, John Malone-Lee, Martijn Stam	J. Cryptol.	3
2009	A New Randomness Extraction Paradigm for Hybrid Encryption Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung	EUROCRYPT	3
2009	Blockcipher-Based Hashing Revisited Martijn Stam	FSE	1
2009	Another Glance at Double-Length Hashing Onur Özen, Martijn Stam	IMACC	2
2008	Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions Martijn Stam	CRYPTO	1
2008	Building a Collision-Resistant Compression Function from Non-compressing Primitives Thomas Shrimpton, Martijn Stam	ICALP (2)	2
2007	Obfuscation for Cryptographic Purposes Dennis Hofheinz, John Malone-Lee, Martijn Stam	TCC	3
2006	List signature schemes Sébastien Canard, Berry Schoenmakers, Martijn Stam, Jacques Traoré	Discret. Appl. Math.	3
2005	Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields Ronald Cramer, Serge Fehr, Martijn Stam	CRYPTO	3
2005	Practical Cryptography in High Dimensional Tori Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff	EUROCRYPT	6
2005	Hash Based Digital Signature Schemes C. Dods, Nigel P. Smart, Martijn Stam	IMACC	3
2005	A Key Encapsulation Mechanism for NTRU Martijn Stam	IMACC	1
2005	Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three abstract Although identity-based cryptography offers a number of functional advantages over conventional public key methods, the computational costs are significantly greater. The dominant part of this cost is the Tate pairing, which, in characteristic three, is best computed using the algorithm of Duursma and Lee. However, in hardware and constrained environments, this algorithm is unattractive since it requires online computation of cube roots or enough storage space to precompute required results. We examine the use of normal basis arithmetic in characteristic three in an attempt to get the best of both worlds: an efficient method for computing the Tate pairing that requires no precomputation and that may also be implemented in hardware to accelerate devices such as smart-cards. Robert Granger, Dan Page, Martijn Stam	IEEE Trans. Computers	3
2002	Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions Martijn Stam, Arjen K. Lenstra	CHES	1
2001	Speeding Up XTR Martijn Stam, Arjen K. Lenstra	ASIACRYPT	1