Dynamic traitor tracing for arbitrary alphabets: Divide and conquer. - Thijs Laarhoven; Jan-Jaap Oosterwijk; Jeroen Doumen (WIFS, 2012)

The Collatz conjecture and De Bruijn graphs - Thijs Laarhoven; Benne de Weger (CoRR, 2012)

Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems. - Thijs Laarhoven; Joop van de Pol; Benne de Weger (IACR Cryptol. ePrint Arch., 2012)

Efficient probabilistic group testing based on traitor tracing. - Thijs Laarhoven (Allerton, 2013)

Discrete distributions in the tardos scheme, revisited. - Thijs Laarhoven; Benne de Weger (IH&MMSec, 2013)

Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search. - Thijs Laarhoven; Michele Mosca; Joop van de Pol (PQCrypto, 2013)

Dynamic traitor tracing schemes, revisited. - Thijs Laarhoven (WIFS, 2013)

Dynamic Tardos Traitor Tracing Schemes. - Thijs Laarhoven; Jeroen Doumen; Peter Roelse; Boris Skoric; Benne de Weger (IEEE Trans. Inf. Theory, 2013)

Capacities and capacity-achieving decoders for various fingerprinting games. - Thijs Laarhoven (IH&MMSec, 2014)

Optimal symmetric Tardos traitor tracing schemes. - Thijs Laarhoven; Benne de Weger (Des. Codes Cryptogr., 2014)

Sieving for shortest vectors in lattices using angular locality-sensitive hashing. - Thijs Laarhoven (IACR Cryptol. ePrint Arch., 2014)

Tuple decoders for traitor tracing schemes. - Jan-Jaap Oosterwijk; Jeroen Doumen; Thijs Laarhoven (IACR Cryptol. ePrint Arch., 2014)

Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP. - Artur Mariano; Christian H. Bischof; Thijs Laarhoven (ICPP, 2015)

Optimal Sequential Fingerprinting: Wald vs. Tardos. - Thijs Laarhoven (IH&MMSec, 2015)

Practical and Optimal LSH for Angular Distance. - Alexandr Andoni; Piotr Indyk; Thijs Laarhoven; Ilya P. Razenshteyn; Ludwig Schmidt (NIPS, 2015)

Tradeoffs for nearest neighbors on the sphere. - Thijs Laarhoven (CoRR, 2015)

Finding shortest lattice vectors faster using quantum search. - Thijs Laarhoven; Michele Mosca; Joop van de Pol (Des. Codes Cryptogr., 2015)

New directions in nearest neighbor searching with applications to lattice sieving. - Anja Becker 001; Léo Ducas; Nicolas Gama; Thijs Laarhoven (IACR Cryptol. ePrint Arch., 2015)

Efficient (ideal) lattice sieving using cross-polytope LSH. - Anja Becker 001; Thijs Laarhoven (IACR Cryptol. ePrint Arch., 2015)

Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing. - Thijs Laarhoven; Benne de Weger (IACR Cryptol. ePrint Arch., 2015)

Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP. - Artur Mariano; Thijs Laarhoven; Christian H. Bischof (IACR Cryptol. ePrint Arch., 2015)

Asymptotics of Fingerprinting and Group Testing: Tight Bounds From Channel Capacities. - Thijs Laarhoven (IEEE Trans. Inf. Forensics Secur., 2015)

Sieving for Closest Lattice Vectors (with Preprocessing). - Thijs Laarhoven (SAC, 2016)

Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors. - Alexandr Andoni; Thijs Laarhoven; Ilya P. Razenshteyn; Erik Waingarten (CoRR, 2016)

Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders. - Thijs Laarhoven (EURASIP J. Inf. Secur., 2016)

Randomized lattice sieving for the closest vector problem (with preprocessing). - Thijs Laarhoven (IACR Cryptol. ePrint Arch., 2016)

A Parallel Variant of LDSieve for the SVP on Lattices. - Artur Mariano; Thijs Laarhoven; Christian H. Bischof (IACR Cryptol. ePrint Arch., 2016)

Tuple lattice sieving. - Shi Bai 001; Thijs Laarhoven; Damien Stehlé (LMS J. Comput. Math., 2016)

Hypercube LSH for Approximate near Neighbors. - Thijs Laarhoven (MFCS, 2017)

Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. - Alexandr Andoni; Thijs Laarhoven; Ilya P. Razenshteyn; Erik Waingarten (SODA, 2017)

A Practical View of the State-of-the-Art of Lattice-Based Cryptanalysis. - Artur Mariano; Thijs Laarhoven; Fábio Correia; Manuel Rodrigues 002; Gabriel Falcão 001 (IEEE Access, 2017)

Faster tuple lattice sieving using spherical locality-sensitive filters. - Thijs Laarhoven (CoRR, 2017)

Speed-ups and time-memory trade-offs for tuple lattice sieving. - Gottfried Herold; Elena Kirshanova; Thijs Laarhoven (IACR Cryptol. ePrint Arch., 2017)

Graph-Based Time-Space Trade-Offs for Approximate Near Neighbors. - Thijs Laarhoven (SoCG, 2018)

Round5: Compact and Fast Post-Quantum Public-Key Encryption. - Sauvik Bhattacharya; Óscar García-Morchón; Thijs Laarhoven; Ronald Rietman; Markku-Juhani O. Saarinen; Ludo Tolhuizen; Zhenfei Zhang (IACR Cryptol. ePrint Arch., 2018)

Progressive lattice sieving. - Thijs Laarhoven; Artur Mariano (IACR Cryptol. ePrint Arch., 2018)

Nearest Neighbor Decoding for Tardos Fingerprinting Codes. - Thijs Laarhoven (IH&MMSec, 2019)

Evolutionary Techniques in Lattice Sieving Algorithms. - Thijs Laarhoven (IJCCI, 2019)

Finding Closest Lattice Vectors Using Approximate Voronoi Cells. - Emmanouil Doulgerakis; Thijs Laarhoven; Benne de Weger (PQCrypto, 2019)

Round5: Compact and Fast Post-Quantum Public-Key Encryption. - Hayo Baan; Sauvik Bhattacharya; Scott R. Fluhrer; Óscar García-Morchón; Thijs Laarhoven; Ronald Rietman; Markku-Juhani O. Saarinen; Ludo Tolhuizen; Zhenfei Zhang (IACR Cryptol. ePrint Arch., 2019)

Polytopes, Lattices, and Spherical Codes for the Nearest Neighbor Problem. - Thijs Laarhoven (ICALP, 2020)

Sieve, Enumerate, Slice, and Lift: Hybrid Lattice Algorithms for SVP via CVPP. - Emmanouil Doulgerakis; Thijs Laarhoven; Benne de Weger (IACR Cryptol. ePrint Arch., 2020)

The randomized slicer for CVPP: sharper, faster, smaller, batchier. - Léo Ducas; Thijs Laarhoven; Wessel P. J. van Woerden (IACR Cryptol. ePrint Arch., 2020)

The irreducible vectors of a lattice: Some theory and applications. - Emmanouil Doulgerakis; Thijs Laarhoven; Benne de Weger (IACR Cryptol. ePrint Arch., 2021)

Lower bounds on lattice sieving and information set decoding. - Elena Kirshanova; Thijs Laarhoven (IACR Cryptol. ePrint Arch., 2021)

Dual lattice attacks for closest vector problems (with preprocessing). - Thijs Laarhoven; Michael Walter 001 (IACR Cryptol. ePrint Arch., 2021)

Approximate Voronoi cells for lattices, revisited. - Thijs Laarhoven (J. Math. Cryptol., 2021)

Towards Transparent Cheat Detection in Online Chess: An Application of Human and Computer Decision-Making Preferences. - Thijs Laarhoven; Aditya Ponukumati (CG, 2022)

The irreducible vectors of a lattice. - Emmanouil Doulgerakis; Thijs Laarhoven; Benne de Weger (Des. Codes Cryptogr., 2023)

Oblivious Graph Algorithms for Solving TSP and VRP Using FHE and MPC. - Sam Leder; Thijs Laarhoven (I4CS, 2024)