Name
Affiliation
Papers
MARTIJN STAM
eindhoven university of technology
53
Collaborators
Citations 
PageRank 
72
1659
67.36
Referers 
Referees 
References 
1811
840
1023
Search Limit
1001000
Title
Citations
PageRank
Year
Multi-Instance Secure Public-Key Encryption.00.342022
XTR and Tori.00.342021
Untagging Tor: A Formal Treatment of Onion Encryption.00.342018
Assessing the Feasibility of Single Trace Power Analysis of Frodo.00.342018
Fly, you fool! Faster Frodo for the ARM Cortex-M4.00.342018
Authenticated Encryption in the Face of Protocol and Side Channel Leakage.20.382017
Turning Online Ciphers Off.10.352017
Multi-Key Authenticated Encryption with Corruptions: Reductions are Lossy.10.352017
Modes Of Operation Suitable For Computing On Encrypted Data40.412017
The Security of Tandem-DM in the Ideal Cipher Model.10.372017
How low can you go? Using side-channel data to enhance brute-force key recovery.00.342016
Indifferentiability of Confusion-Diffusion Networks.30.372016
A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case.30.422016
Characterisation and Estimation of the Key Rank Distribution in the Context of Side Channel Evaluations.120.592016
Rogue Decryption Failures: Reconciling AE Robustness Notions.120.512015
How to Enumerate Your Keys Accurately and Efficiently After a Side Channel Attack.00.342015
Counting Keys in Parallel After a Side Channel Attack170.712015
Indifferentiability of Confusion-Diffusion Networks.00.342015
Simulatable Leakage: Analysis, Pitfalls, and New Constructions.80.422014
KDM Security in the Hybrid Framework.40.422014
Making and Breaking Leakage Simulators.00.342014
MJH: a faster alternative to MDC-2170.602014
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions.50.412013
On Symmetric Encryption with Distinguishable Decryption Failures.270.922013
A Leakage Resilient MAC.20.362013
Collisions are not incidental: a compression function exploiting discrete geometry80.542012
Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation.280.832012
Understanding adaptivity: random systems revisited1293.132012
The preimage security of double-block-length compression functions1623.952011
The symbiosis between collision and preimage resistance50.422011
Efficient hashing using the AES instruction set120.582011
The collision security of tandem-DM in the ideal cipher model281.052011
On the joint security of encryption and signature, revisited220.872011
Obfuscation for Cryptographic Purposes372.162010
Random Oracles with(out) Programmability180.622010
Collision Attacks against the Knudsen-Preneel Compression Functions20.352010
Attacking the Knudsen-Preneel compression functions30.362010
Another Glance at Double-Length Hashing270.942009
A New Randomness Extraction Paradigm for Hybrid Encryption39112.502009
Blockcipher-Based Hashing Revisited411.372008
Building a Collision-Resistant Compression Function from Non-compressing Primitives442.482008
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions41413.892008
List signature schemes110.582006
Discrete logarithm variants of VSH50.512006
A key encapsulation mechanism for NTRU60.482005
Black-box secret sharing from primitive sets in algebraic number fields90.792005
Practical cryptography in high dimensional tori271.272005
Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three311.842005
On XTR and side-channel analysis40.462004
A Comparison of CEILIDH and XTR241.112004
  • 1
  • 2