Mark Simkin
Cryptography researcher at Flashbots and tenure-track professor at Aarhus University.I write here about cryptography, algorithms, and the math in between.
/writing
Nothing published yet.
Notes on cryptography, algorithms, and the math in between are on their way.
/publications
CCS 2026
Robust Distributed Arrays: Provably Secure Networking for Data Availability SamplingDankrad Feist, Gottfried Herold, Mark Simkin, Benedikt Wagner
Asiacrypt 2026
Scale, Round, Break: Simple Leakage Attacks on Secret Sharing SchemesKatharina Boudgoust, Mark Simkin
Eurocrypt 2026
Oblivious Ciphertext Compression via Linear CodesPascal Giorgi, Bruno Grenet, Mark Simkin
PKC 2025
OCash: Fully Anonymous Payments between Blockchain Light ClientsAdam Blatchley Hansen, Jesper Buus Nielsen, Mark Simkin
CRYPTO 2024
FRIDA: Data Availability Sampling from FRIMathias Hall-Andersen, Mark Simkin, Benedikt Wagner
All publications →
/about
bio
I am a tenure-track professor at Aarhus University and a cryptography researcher at Flashbots. I received my PhD from Aarhus University in 2019, advised by Ivan Damgård and co-advised by Claudio Orlandi, and stayed on as a postdoctoral researcher with Kasper Green Larsen. On the industry side, I was a cryptography researcher at the Ethereum Foundation before joining Flashbots.
contact
firstname at univariate.org