About me
I am a principal cryptographer at NXP Semiconductors in Eindhoven, The Netherlands. My work focuses on lattice algorithms, nearest neighbor methods, and post-quantum cryptography, from cryptanalysis to efficient, secure implementations.
Previously, I was a research scientist at TNO in The Hague, a postdoctoral researcher at the Eindhoven University of Technology and IBM Research in Zurich, and a visiting scientist at the Simons Institute, UC Berkeley, in spring 2020. I obtained my PhD in cryptography at the Eindhoven University of Technology in 2016, after an MSc graduation project at Irdeto.
Research
Post-quantum cryptography
My work on post-quantum cryptography spans the design, analysis, and secure implementation of cryptographic systems. At IBM Research, I worked on lattice-based cryptographic constructions and their security. I coauthored Round5, a lattice-based public-key encryption scheme submitted to the NIST post-quantum standardization process. At NXP, I work on implementing NIST PQC standards on new silicon platforms, including performance, side-channel resistance, and protection against fault attacks.
Lattice algorithms
Lattice algorithms are central to assessing the security of lattice-based cryptography. My work includes lattice sieving, nearest neighbor techniques, and classical and quantum time–memory trade-offs. My CRYPTO 2015 paper connected lattice sieving with angular locality-sensitive hashing, followed by our SODA 2016 work on locality-sensitive filtering. Our CRYPTO 2021 paper established conditional lower bounds for broad classes of sieving algorithms. In our 2026 SVP paper, we develop superlattice methods for provable shortest-vector algorithms and discrete Gaussian sampling.
Nearest neighbor methods
Nearest neighbor search finds similar vectors in large, high-dimensional data sets, with applications to similarity search and cryptanalysis. Our NeurIPS 2015 paper studied practical and optimal hashing for angular distance; our SODA 2016 work developed locality-sensitive filtering, and our SODA 2017 paper established optimal hashing-based time–space trade-offs. FALCONN provides a C++ implementation with Python bindings for methods from our NeurIPS 2015 work.
Privacy-enhancing technologies
Privacy-enhancing technologies allow useful computations while protecting the underlying data. Fully homomorphic encryption (FHE) enables computation on encrypted data, while secure multiparty computation (MPC) lets several parties jointly compute a result without disclosing their individual inputs to one another. At TNO, I worked on translating these techniques into practical prototypes. With Sam Leder, I studied oblivious graph algorithms for routing problems using FHE and MPC.
Collusion-resistant fingerprinting
Collusion-resistant fingerprinting embeds user-specific marks in copies of digital content so that users who combine their copies can still be traced. My research covers dynamic traitor tracing, efficient decoders, and connections to group testing. This includes our IEEE Transactions on Information Theory paper on dynamic Tardos schemes, my IEEE Transactions on Information Forensics and Security paper on fingerprinting and group-testing capacities, and work at WIFS 2012 and IH&MMSec 2015 on tracing schemes and decoding.
Other
I enjoy chess and puzzles, am a FIDE Master, and previously volunteered as a Lichess team member. My chess projects include Lichess tournament rankings and statistics, as well as research on online cheat detection.