@misc{hhan26-superlattice,
  author = {Minki Hhan and Jiseung Kim and Sunyeop Kim and Thijs Laarhoven},
  title = {{Superlattice methods for the shortest vector problem and discrete Gaussian sampling}},
  year = {2026},
  howpublished = {Cryptology ePrint Archive, Paper 2026/2761},
  url = {https://eprint.iacr.org/2026/2761},
}

@misc{arxiv-2610.15265,
  author = {Thijs Laarhoven},
  title = {{Asymptotics of Random-Lattice Enumeration: Beyond HKZ via Dense Sublattices}},
  year = {2026},
  eprint = {2610.15265},
  archivePrefix = {arXiv},
  howpublished = {arXiv preprint},
  url = {https://arxiv.org/abs/2610.15265},
}

@misc{arxiv-2609.37483,
  author = {Thijs Laarhoven},
  title = {{Dual lattice attacks for bounded distance decoding, revisited}},
  year = {2026},
  eprint = {2609.37483},
  archivePrefix = {arXiv},
  howpublished = {arXiv preprint},
  url = {https://arxiv.org/abs/2609.37483},
}

@misc{arxiv-2609.37482,
  author = {Emmanouil Doulgerakis and Thijs Laarhoven},
  title = {{Smooth Sailing through Spherical Shells: Provable Random-Lattice Sieving in Time $2^{0.292n}$}},
  year = {2026},
  eprint = {2609.37482},
  archivePrefix = {arXiv},
  howpublished = {arXiv preprint},
  url = {https://arxiv.org/abs/2609.37482},
}

@misc{arxiv-2609.13635,
  author = {Thijs Laarhoven},
  title = {{Spherical statistics and phase transitions in high-dimensional lattices}},
  year = {2026},
  eprint = {2609.13635},
  archivePrefix = {arXiv},
  howpublished = {arXiv preprint},
  url = {https://arxiv.org/abs/2609.13635},
}

@misc{arxiv-2609.13608,
  author = {Thijs Laarhoven and Scott Duke Kominers},
  title = {{A lattice family with kissing numbers $\tau(\mathcal{L}_n) \ge e^{2\sqrt{n}}$}},
  year = {2026},
  eprint = {2609.13608},
  archivePrefix = {arXiv},
  howpublished = {arXiv preprint},
  url = {https://arxiv.org/abs/2609.13608},
}

@misc{arxiv-2609.08190,
  author = {Thijs Laarhoven},
  title = {{A Note on Sphere Packing Bounds for Tuple Lattice Sieving}},
  year = {2026},
  eprint = {2609.08190},
  archivePrefix = {arXiv},
  howpublished = {arXiv preprint},
  url = {https://arxiv.org/abs/2609.08190},
}

@inproceedings{leder23,
  author = {Sam Leder and Thijs Laarhoven},
  title = {{Oblivious Graph Algorithms for Solving TSP and VRP Using FHE and MPC}},
  booktitle = {I4CS 2024},
  year = {2024},
  pages = {169--196},
  publisher = {Springer},
  doi = {10.1007/978-3-031-60433-1_11},
  url = {https://doi.org/10.1007/978-3-031-60433-1_11},
}

@article{doulgerakis23,
  author = {Emmanouil Doulgerakis and Thijs Laarhoven and Benne de Weger},
  title = {{The irreducible vectors of a lattice}},
  journal = {Designs, Codes and Cryptography},
  year = {2023},
  volume = {91},
  pages = {609--643},
  doi = {10.1007/s10623-022-01119-y},
  url = {https://doi.org/10.1007/s10623-022-01119-y},
}

@inproceedings{laarhoven22cg,
  author = {Thijs Laarhoven and Aditya Ponukumati},
  title = {{Towards Transparent Cheat Detection in Online Chess: An Application of Human and Computer Decision-Making Preferences}},
  booktitle = {Computers and Games (CG 2022)},
  year = {2023},
  pages = {163--180},
  publisher = {Springer},
  doi = {10.1007/978-3-031-34017-8_14},
  url = {https://doi.org/10.1007/978-3-031-34017-8_14},
}

@inproceedings{kirshanova21,
  author = {Elena Kirshanova and Thijs Laarhoven},
  title = {{Lower Bounds on Lattice Sieving and Information Set Decoding}},
  booktitle = {Crypto},
  year = {2021},
  pages = {791--820},
  doi = {10.1007/978-3-030-84245-1_27},
  url = {https://doi.org/10.1007/978-3-030-84245-1_27},
}

@inproceedings{laarhoven21ctrsa,
  author = {Thijs Laarhoven and Michael Walter},
  title = {{Dual lattice attacks for closest vector problems (with preprocessing)}},
  booktitle = {CT-RSA},
  year = {2021},
  pages = {478--502},
  editor = {Kenneth G. Paterson},
  doi = {10.1007/978-3-030-75539-3_20},
  url = {https://doi.org/10.1007/978-3-030-75539-3_20},
  isbn = {978-3-030-75539-3},
}

@article{laarhoven20jomc,
  author = {Thijs Laarhoven},
  title = {{Approximate Voronoi cells for lattices, revisited}},
  journal = {Journal of Mathematical Cryptology},
  year = {2021},
  volume = {15},
  number = {1},
  pages = {60--71},
  doi = {10.1515/jmc-2020-0074},
  url = {https://doi.org/10.1515/jmc-2020-0074},
}

@inproceedings{laarhoven20icalp,
  author = {Thijs Laarhoven},
  title = {{Polytopes, lattices, and spherical codes for the nearest neighbor problem}},
  booktitle = {ICALP},
  year = {2020},
  pages = {76:1--76:14},
  doi = {10.4230/LIPIcs.ICALP.2020.76},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.76},
}

@inproceedings{doulgerakis20,
  author = {Emmanouil Doulgerakis and Thijs Laarhoven and Benne de Weger},
  title = {{Sieve, enumerate, slice, and lift: Hybrid lattice algorithms for SVP via CVPP}},
  booktitle = {AfricaCrypt},
  year = {2020},
  pages = {301--320},
  doi = {10.1007/978-3-030-51938-4_15},
  url = {https://doi.org/10.1007/978-3-030-51938-4_15},
}

@inproceedings{ducas20,
  author = {Léo Ducas and Thijs Laarhoven and Wessel P. J. van Woerden},
  title = {{The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier}},
  booktitle = {Public-Key Cryptography - PKC 2020},
  year = {2020},
  pages = {3--36},
  publisher = {Springer},
  doi = {10.1007/978-3-030-45388-6_1},
  url = {https://doi.org/10.1007/978-3-030-45388-6_1},
}

@inproceedings{laarhoven19ecta,
  author = {Thijs Laarhoven},
  title = {{Evolutionary techniques in lattice sieving algorithms}},
  booktitle = {ECTA},
  year = {2019},
  pages = {31--39},
  doi = {10.5220/0007968800310039},
  url = {https://doi.org/10.5220/0007968800310039},
  note = {Best Paper Award},
}

@inproceedings{laarhoven19ihmmsec,
  author = {Thijs Laarhoven},
  title = {{Nearest neighbor decoding for Tardos fingerprinting codes}},
  booktitle = {IH&MMSec},
  year = {2019},
  pages = {182--187},
  publisher = {Association for Computing Machinery},
  doi = {10.1145/3335203.3335732},
  url = {https://doi.org/10.1145/3335203.3335732},
  isbn = {9781450368216},
}

@inproceedings{round5,
  author = {Hayo Baan and Sauvik Bhattacharya and Scott Fluhrer and Óscar García-Morchón and Thijs Laarhoven and Ronald Rietman and Markku-Juhani O. Saarinen and Ludo Tolhuizen and Zhenfei Zhang},
  title = {{Round5: Compact and fast post-quantum public-key encryption}},
  booktitle = {PQCrypto},
  year = {2019},
  pages = {83--102},
  doi = {10.1007/978-3-030-25510-7_5},
  url = {https://doi.org/10.1007/978-3-030-25510-7_5},
}

@inproceedings{doulgerakis19,
  author = {Emmanouil Doulgerakis and Thijs Laarhoven and Benne de Weger},
  title = {{Finding closest lattice vectors using approximate Voronoi cells}},
  booktitle = {PQCrypto},
  year = {2019},
  pages = {3--22},
  doi = {10.1007/978-3-030-25510-7_1},
  url = {https://doi.org/10.1007/978-3-030-25510-7_1},
}

@inproceedings{laarhoven18socg,
  author = {Thijs Laarhoven},
  title = {{Graph-based time-space trade-offs for approximate near neighbors}},
  booktitle = {SOCG},
  year = {2018},
  pages = {57:1--57:14},
  doi = {10.4230/LIPIcs.SoCG.2018.57},
  url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.57},
}

@inproceedings{laarhoven18pqcrypto,
  author = {Thijs Laarhoven and Artur Mariano},
  title = {{Progressive lattice sieving}},
  booktitle = {PQCrypto},
  year = {2018},
  pages = {292--311},
  doi = {10.1007/978-3-319-79063-3_14},
  url = {https://doi.org/10.1007/978-3-319-79063-3_14},
}

@inproceedings{herold18,
  author = {Gottfried Herold and Elena Kirshanova and Thijs Laarhoven},
  title = {{Speed-ups and time-memory trade-offs for tuple lattice sieving}},
  booktitle = {PKC},
  year = {2018},
  pages = {407--436},
  doi = {10.1007/978-3-319-76578-5_14},
  url = {https://doi.org/10.1007/978-3-319-76578-5_14},
}

@inproceedings{laarhoven17mfcs,
  author = {Thijs Laarhoven},
  title = {{Hypercube LSH for approximate near neighbors}},
  booktitle = {MFCS},
  year = {2017},
  pages = {1--20},
  doi = {10.4230/LIPIcs.MFCS.2017.7},
  url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.7},
}

@inproceedings{mariano17,
  author = {Artur Mariano and Thijs Laarhoven and Christian Bischof},
  title = {{A parallel variant of LDSieve for the SVP on lattices}},
  booktitle = {PDP},
  year = {2017},
  pages = {23--30},
  doi = {10.1109/PDP.2017.60},
  url = {https://doi.org/10.1109/PDP.2017.60},
}

@article{laarhoven17tuple,
  author = {Thijs Laarhoven},
  title = {{Faster tuple lattice sieving using spherical locality-sensitive filters}},
  journal = {arXiv:1705.02828 [cs.DS]},
  year = {2017},
  pages = {1--14},
  doi = {10.48550/arXiv.1705.02828},
  url = {https://doi.org/10.48550/arXiv.1705.02828},
}

@article{mariano17b,
  author = {Artur Mariano and Thijs Laarhoven and Fábio Correia and Manuel Rodrigues and Gabriel Falcao},
  title = {{A practical view of the state-of-the-art of lattice-based cryptanalysis}},
  journal = {IEEE Access},
  year = {2017},
  volume = {5},
  pages = {24184--24202},
  doi = {10.1109/ACCESS.2017.2748179},
  url = {https://doi.org/10.1109/ACCESS.2017.2748179},
}

@inproceedings{andoni17,
  author = {Alexandr Andoni and Thijs Laarhoven and Ilya Razenshteyn and Erik Waingarten},
  title = {{Optimal hashing-based time-space trade-offs for approximate near neighbors}},
  booktitle = {SODA},
  year = {2017},
  pages = {47--66},
  doi = {10.1137/1.9781611974782.4},
  url = {https://doi.org/10.1137/1.9781611974782.4},
  note = {Invited to the ACM Transactions on Algorithms},
}

@inproceedings{laarhoven16sac,
  author = {Thijs Laarhoven},
  title = {{Sieving for closest lattice vectors (with preprocessing)}},
  booktitle = {SAC},
  year = {2016},
  pages = {523--542},
  doi = {10.1007/978-3-319-69453-5_28},
  url = {https://doi.org/10.1007/978-3-319-69453-5_28},
}

@inproceedings{bai16,
  author = {Shi Bai and Thijs Laarhoven and Damien Stehlé},
  title = {{Tuple lattice sieving}},
  booktitle = {ANTS},
  year = {2016},
  pages = {146--162},
  doi = {10.1112/S1461157016000292},
  url = {https://doi.org/10.1112/S1461157016000292},
}

@article{andoni16,
  author = {Alexandr Andoni and Thijs Laarhoven and Ilya Razenshteyn and Erik Waingarten},
  title = {{Lower bounds on time-space trade-offs for approximate near neighbors}},
  journal = {arXiv:1605.02701 [cs.DS]},
  year = {2016},
  volume = {abs/1605.02701},
  pages = {1--47},
  doi = {10.48550/arXiv.1605.02701},
  url = {https://doi.org/10.48550/arXiv.1605.02701},
}

@inproceedings{becker16cp,
  author = {Anja Becker and Thijs Laarhoven},
  title = {{Efficient (ideal) lattice sieving using cross-polytope LSH}},
  booktitle = {AfricaCrypt},
  year = {2016},
  pages = {3--23},
  doi = {10.1007/978-3-319-31517-1_1},
  url = {https://doi.org/10.1007/978-3-319-31517-1_1},
}

@phdthesis{laarhoven16phd,
  author = {Thijs Laarhoven},
  title = {{Search problems in cryptography}},
  booktitle = {PhD Thesis},
  year = {2016},
  school = {Eindhoven University of Technology},
  url = {https://thijs.com/docs/phd-final.pdf},
  note = {Graduated cum laude},
}

@inproceedings{becker16lsf,
  author = {Anja Becker and Léo Ducas and Nicolas Gama and Thijs Laarhoven},
  title = {{New directions in nearest neighbor searching with applications to lattice sieving}},
  booktitle = {SODA},
  year = {2016},
  pages = {10--24},
  doi = {10.1137/1.9781611974331.ch2},
  url = {https://doi.org/10.1137/1.9781611974331.ch2},
}

@article{laarhoven16eurasip,
  author = {Thijs Laarhoven},
  title = {{Asymptotics of fingerprinting and group testing: Capacity-achieving log-likelihood decoders}},
  journal = {EURASIP Journal on Information Security},
  year = {2016},
  volume = {2016},
  number = {3},
  pages = {1--15},
  doi = {10.1186/s13635-015-0026-8},
  url = {https://doi.org/10.1186/s13635-015-0026-8},
}

@article{laarhoven15nns,
  author = {Thijs Laarhoven},
  title = {{Tradeoffs for nearest neighbors on the sphere}},
  journal = {arXiv:1511.07527 [cs.DS]},
  year = {2015},
  pages = {1--16},
  doi = {10.48550/arXiv.1511.07527},
  url = {https://doi.org/10.48550/arXiv.1511.07527},
}

@inproceedings{andoni15,
  author = {Alexandr Andoni and Piotr Indyk and Thijs Laarhoven and Ilya Razenshteyn and Ludwig Schmidt},
  title = {{Practical and optimal LSH for angular distance}},
  booktitle = {NeurIPS},
  year = {2015},
  pages = {1225--1233},
  editor = {Corinna Cortes and Neil D. Lawrence and Daniel D. Lee and Masashi Sugiyama and Roman Garnett},
  url = {https://proceedings.neurips.cc/paper/2015/hash/2823f4797102ce1a1aec05359cc16dd9-Abstract.html},
}

@inproceedings{mariano15,
  author = {Artur Mariano and Thijs Laarhoven and Christian Bischof},
  title = {{Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP}},
  booktitle = {ICPP},
  year = {2015},
  pages = {590--599},
  doi = {10.1109/ICPP.2015.68},
  url = {https://doi.org/10.1109/ICPP.2015.68},
}

@inproceedings{laarhoven15latincrypt,
  author = {Thijs Laarhoven and Benne de Weger},
  title = {{Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing}},
  booktitle = {LatinCrypt},
  year = {2015},
  pages = {101--118},
  doi = {10.1007/978-3-319-22174-8_6},
  url = {https://doi.org/10.1007/978-3-319-22174-8_6},
}

@inproceedings{laarhoven15crypto,
  author = {Thijs Laarhoven},
  title = {{Sieving for shortest vectors in lattices using angular locality-sensitive hashing}},
  booktitle = {Crypto},
  year = {2015},
  pages = {3--22},
  doi = {10.1007/978-3-662-47989-6_1},
  url = {https://doi.org/10.1007/978-3-662-47989-6_1},
}

@article{laarhoven15tifs,
  author = {Thijs Laarhoven},
  title = {{Asymptotics of fingerprinting and group testing: tight bounds from channel capacities}},
  journal = {IEEE Transactions on Information Forensics and Security},
  year = {2015},
  volume = {10},
  number = {9},
  pages = {1967--1980},
  doi = {10.1109/TIFS.2015.2440190},
  url = {https://doi.org/10.1109/TIFS.2015.2440190},
}

@inproceedings{laarhoven15ihmmsec,
  author = {Thijs Laarhoven},
  title = {{Optimal sequential fingerprinting: Wald vs. Tardos}},
  booktitle = {IH&MMSec},
  year = {2015},
  pages = {97--107},
  doi = {10.1145/2756601.2756603},
  url = {https://doi.org/10.1145/2756601.2756603},
  note = {Best Paper Award},
}

@article{laarhoven15dcc,
  author = {Thijs Laarhoven and Michele Mosca and Joop van de Pol},
  title = {{Finding shortest lattice vectors faster using quantum search}},
  journal = {Designs, Codes and Cryptography},
  year = {2015},
  volume = {77},
  number = {2},
  pages = {375--400},
  doi = {10.1007/s10623-015-0067-5},
  url = {https://doi.org/10.1007/s10623-015-0067-5},
}

@inproceedings{laarhoven14ihmmsec,
  author = {Thijs Laarhoven},
  title = {{Capacities and capacity-achieving decoders for various fingerprinting games}},
  booktitle = {IH&MMSec},
  year = {2014},
  pages = {123--134},
  doi = {10.1145/2600918.2600925},
  url = {https://doi.org/10.1145/2600918.2600925},
  note = {Best Student Paper Award},
}

@article{laarhoven14dcc,
  author = {Thijs Laarhoven and Benne de Weger},
  title = {{Optimal symmetric Tardos traitor tracing schemes}},
  journal = {Designs, Codes and Cryptography},
  year = {2014},
  volume = {71},
  number = {1},
  pages = {83--103},
  doi = {10.1007/s10623-012-9718-y},
  url = {https://thijs.com/docs/dcc12-paper.pdf},
}

@inproceedings{oosterwijk14,
  author = {Jan-Jaap Oosterwijk and Jeroen Doumen and Thijs Laarhoven},
  title = {{Tuple decoders for traitor tracing schemes}},
  booktitle = {SPIE},
  year = {2014},
  pages = {1--21},
  doi = {10.1117/12.2037659},
  url = {https://doi.org/10.1117/12.2037659},
}

@inproceedings{laarhoven13wifs,
  author = {Thijs Laarhoven},
  title = {{Dynamic traitor tracing schemes, revisited}},
  booktitle = {WIFS},
  year = {2013},
  pages = {191--196},
  doi = {10.1109/WIFS.2013.6707817},
  url = {https://thijs.com/docs/wifs13-paper.pdf},
}

@inproceedings{laarhoven13allerton,
  author = {Thijs Laarhoven},
  title = {{Efficient probabilistic group testing based on traitor tracing}},
  booktitle = {Allerton},
  year = {2013},
  pages = {1358--1365},
  doi = {10.1109/Allerton.2013.6736699},
  url = {https://thijs.com/docs/allerton13-paper.pdf},
}

@inproceedings{laarhoven13ihmmsec,
  author = {Thijs Laarhoven and Benne de Weger},
  title = {{Discrete distributions in the Tardos scheme, revisited}},
  booktitle = {IH&MMSec},
  year = {2013},
  pages = {13--18},
  doi = {10.1145/2482513.2482533},
  url = {https://thijs.com/docs/ihmmsec13-paper.pdf},
}

@article{laarhoven13im,
  author = {Thijs Laarhoven and Benne de Weger},
  title = {{The Collatz conjecture and De Bruijn graphs}},
  journal = {Indagationes Mathematicae},
  year = {2013},
  volume = {24},
  number = {4},
  pages = {971--983},
  doi = {10.1016/j.indag.2013.03.003},
  url = {https://thijs.com/docs/indag13-paper.pdf},
}

@inproceedings{laarhoven13pqcrypto,
  author = {Thijs Laarhoven and Michele Mosca and Joop van de Pol},
  title = {{Solving the shortest vector problem in lattices faster using quantum search}},
  booktitle = {PQCrypto},
  year = {2013},
  pages = {83--101},
  doi = {10.1007/978-3-642-38616-9_6},
  url = {https://thijs.com/docs/pqc13-paper.pdf},
}

@article{laarhoven13tit,
  author = {Thijs Laarhoven and Jeroen Doumen and Peter Roelse and Boris Škorić and Benne de Weger},
  title = {{Dynamic Tardos traitor tracing schemes}},
  journal = {IEEE Transactions on Information Theory},
  year = {2013},
  volume = {59},
  number = {7},
  pages = {4230--4242},
  doi = {10.1109/TIT.2013.2251756},
  url = {https://thijs.com/docs/ieeetit11-paper.pdf},
}

@inproceedings{laarhoven12wifs,
  author = {Thijs Laarhoven and Jan-Jaap Oosterwijk and Jeroen Doumen},
  title = {{Dynamic traitor tracing for arbitrary alphabets: Divide and conquer}},
  booktitle = {WIFS},
  year = {2012},
  pages = {240--245},
  doi = {10.1109/WIFS.2012.6412656},
  url = {https://thijs.com/docs/wifs12-paper.pdf},
  note = {Best Paper Award},
}

@misc{roelse12,
  author = {Peter Roelse and Jeroen Doumen and Thijs Laarhoven},
  title = {{Dynamic Tardos traitor tracing schemes}},
  booktitle = {Patent},
  year = {2012},
  number = {PCT/EP2012/058033},
  howpublished = {Patent},
  url = {https://thijs.com/docs/patent.pdf},
  month = {12},
}

@article{laarhoven12kolkata,
  author = {Thijs Laarhoven and Joop van de Pol and Benne de Weger},
  title = {{Solving hard lattice problems and the security of lattice-based cryptosystems}},
  journal = {Cryptology ePrint Archive},
  year = {2012},
  pages = {1--43},
  url = {https://thijs.com/docs/kolkata12-paper.pdf},
}

@mastersthesis{laarhoven11,
  author = {Thijs Laarhoven},
  title = {{Collusion-resistant traitor tracing schemes}},
  booktitle = {Master thesis},
  year = {2011},
  pages = {169 pages},
  school = {Eindhoven University of Technology},
  url = {https://thijs.com/docs/msc11-thesis.pdf},
  note = {Graduated cum laude},
}

@mastersthesis{laarhoven09,
  author = {Thijs Laarhoven},
  title = {{The 3n+1 conjecture}},
  booktitle = {Bachelor thesis},
  year = {2009},
  pages = {65 pages},
  school = {Eindhoven University of Technology},
  type = {Bachelor thesis},
  url = {https://thijs.com/docs/bsc09-thesis.pdf},
}
