Thijs Laarhoven

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 47

Top Topics

Nearest Neighbor

Top Venues

IACR Cryptol. ePrint Arch.

Des. Codes Cryptogr.

Publications

Sam Leder, Thijs Laarhoven
Oblivious Graph Algorithms for Solving TSP and VRP Using FHE and MPC. I4CS (2024)
Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger
The irreducible vectors of a lattice. Des. Codes Cryptogr. 91 (2) (2023)
Thijs Laarhoven, Aditya Ponukumati
Towards Transparent Cheat Detection in Online Chess: An Application of Human and Computer Decision-Making Preferences. CG (2022)
Thijs Laarhoven
Approximate Voronoi cells for lattices, revisited. J. Math. Cryptol. 15 (1) (2021)
Thijs Laarhoven, Michael Walter
Dual lattice attacks for closest vector problems (with preprocessing). IACR Cryptol. ePrint Arch. 2021 (2021)
Elena Kirshanova, Thijs Laarhoven
Lower bounds on lattice sieving and information set decoding. IACR Cryptol. ePrint Arch. 2021 (2021)
Thijs Laarhoven, Michael Walter
Dual Lattice Attacks for Closest Vector Problems (with Preprocessing). CT-RSA (2021)
Elena Kirshanova, Thijs Laarhoven
Lower Bounds on Lattice Sieving and Information Set Decoding. CRYPTO (2) (2021)
Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger
The irreducible vectors of a lattice: Some theory and applications. IACR Cryptol. ePrint Arch. 2021 (2021)
Thijs Laarhoven
Polytopes, Lattices, and Spherical Codes for the Nearest Neighbor Problem. ICALP (2020)
Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger
Sieve, Enumerate, Slice, and Lift: - Hybrid Lattice Algorithms for SVP via CVPP. AFRICACRYPT (2020)
Léo Ducas, Thijs Laarhoven, Wessel P. J. van Woerden
The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier. Public Key Cryptography (2) (2020)
Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger
Sieve, Enumerate, Slice, and Lift: Hybrid Lattice Algorithms for SVP via CVPP. IACR Cryptol. ePrint Arch. 2020 (2020)
Léo Ducas, Thijs Laarhoven, Wessel P. J. van Woerden
The randomized slicer for CVPP: sharper, faster, smaller, batchier. IACR Cryptol. ePrint Arch. 2020 (2020)
Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger
Finding Closest Lattice Vectors Using Approximate Voronoi Cells. PQCrypto (2019)
Hayo Baan, Sauvik Bhattacharya, Scott R. Fluhrer, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang
Round5: Compact and Fast Post-Quantum Public-Key Encryption. IACR Cryptol. ePrint Arch. 2019 (2019)
Thijs Laarhoven
Nearest Neighbor Decoding for Tardos Fingerprinting Codes. IH&MMSec (2019)
Hayo Baan, Sauvik Bhattacharya, Scott R. Fluhrer, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang
Round5: Compact and Fast Post-quantum Public-Key Encryption. PQCrypto (2019)
Thijs Laarhoven
Polytopes, lattices, and spherical codes for the nearest neighbor problem. CoRR (2019)
Thijs Laarhoven
Nearest neighbor decoding for Tardos fingerprinting codes. CoRR (2019)
Thijs Laarhoven
Approximate Voronoi cells for lattices, revisited. CoRR (2019)
Thijs Laarhoven
Evolutionary techniques in lattice sieving algorithms. CoRR (2019)
Thijs Laarhoven
Evolutionary Techniques in Lattice Sieving Algorithms. IJCCI (2019)
Gottfried Herold, Elena Kirshanova, Thijs Laarhoven
Speed-Ups and Time-Memory Trade-Offs for Tuple Lattice Sieving. Public Key Cryptography (1) (2018)
Thijs Laarhoven, Artur Mariano
Progressive Lattice Sieving. PQCrypto (2018)
Sauvik Bhattacharya, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang
Round5: Compact and Fast Post-Quantum Public-Key Encryption. IACR Cryptol. ePrint Arch. 2018 (2018)
Thijs Laarhoven
Graph-Based Time-Space Trade-Offs for Approximate Near Neighbors. SoCG (2018)
Thijs Laarhoven, Artur Mariano
Progressive lattice sieving. IACR Cryptol. ePrint Arch. 2018 (2018)
Gottfried Herold, Elena Kirshanova, Thijs Laarhoven
Speed-ups and time-memory trade-offs for tuple lattice sieving. IACR Cryptol. ePrint Arch. 2017 (2017)
Artur Mariano, Thijs Laarhoven, Christian H. Bischof
A Parallel Variant of LDSieve for the SVP on Lattices. PDP (2017)
Thijs Laarhoven
Graph-based time-space trade-offs for approximate near neighbors. CoRR (2017)
Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. SODA (2017)
Thijs Laarhoven
Hypercube LSH for Approximate near Neighbors. MFCS (2017)
Thijs Laarhoven
Faster tuple lattice sieving using spherical locality-sensitive filters. CoRR (2017)
Artur Mariano, Thijs Laarhoven, Fábio Correia, Manuel Rodrigues, Gabriel Falcão
A Practical View of the State-of-the-Art of Lattice-Based Cryptanalysis. IEEE Access 5 (2017)
Thijs Laarhoven
Hypercube LSH for approximate near neighbors. CoRR (2017)
Shi Bai, Thijs Laarhoven, Damien Stehlé
Tuple lattice sieving. LMS J. Comput. Math. 19 (A) (2016)
Shi Bai, Thijs Laarhoven, Damien Stehlé
Tuple lattice sieving. IACR Cryptol. ePrint Arch. 2016 (2016)
Thijs Laarhoven
Sieving for Closest Lattice Vectors (with Preprocessing). SAC (2016)
Artur Mariano, Thijs Laarhoven, Christian H. Bischof
A Parallel Variant of LDSieve for the SVP on Lattices. IACR Cryptol. ePrint Arch. 2016 (2016)
Anja Becker, Thijs Laarhoven
Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH. AFRICACRYPT (2016)
Thijs Laarhoven
Randomized lattice sieving for the closest vector problem (with preprocessing). IACR Cryptol. ePrint Arch. 2016 (2016)
Thijs Laarhoven
Sieving for closest lattice vectors (with preprocessing). CoRR (2016)
Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven
New directions in nearest neighbor searching with applications to lattice sieving. SODA (2016)
Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. CoRR (2016)
Thijs Laarhoven
Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders. EURASIP J. Inf. Secur. 2016 (2016)
Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten
Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors. CoRR (2016)
Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt
Practical and Optimal LSH for Angular Distance. NIPS (2015)
Thijs Laarhoven
Asymptotics of Fingerprinting and Group Testing: Tight Bounds From Channel Capacities. IEEE Trans. Inf. Forensics Secur. 10 (9) (2015)
Artur Mariano, Christian H. Bischof, Thijs Laarhoven
Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP. ICPP (2015)
Anja Becker, Thijs Laarhoven
Efficient (ideal) lattice sieving using cross-polytope LSH. IACR Cryptol. ePrint Arch. 2015 (2015)
Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven
New directions in nearest neighbor searching with applications to lattice sieving. IACR Cryptol. ePrint Arch. 2015 (2015)
Thijs Laarhoven
Tradeoffs for nearest neighbors on the sphere. CoRR (2015)
Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt
Practical and Optimal LSH for Angular Distance. CoRR (2015)
Artur Mariano, Thijs Laarhoven, Christian H. Bischof
Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP. IACR Cryptol. ePrint Arch. 2015 (2015)
Thijs Laarhoven, Benne de Weger
Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing. IACR Cryptol. ePrint Arch. 2015 (2015)
Thijs Laarhoven, Michele Mosca, Joop van de Pol
Finding shortest lattice vectors faster using quantum search. Des. Codes Cryptogr. 77 (2-3) (2015)
Thijs Laarhoven
Optimal Sequential Fingerprinting: Wald vs. Tardos. IH&MMSec (2015)
Thijs Laarhoven
Optimal sequential fingerprinting: Wald vs. Tardos. CoRR (2015)
Thijs Laarhoven
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing. CRYPTO (1) (2015)
Thijs Laarhoven, Benne de Weger
Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing. LATINCRYPT (2015)
Thijs Laarhoven
Capacities and Capacity-Achieving Decoders for Various Fingerprinting Games. CoRR (2014)
Jan-Jaap Oosterwijk, Jeroen Doumen, Thijs Laarhoven
Tuple decoders for traitor tracing schemes. IACR Cryptol. ePrint Arch. 2014 (2014)
Thijs Laarhoven
Asymptotics of Fingerprinting and Group Testing: Capacity-Achieving Log-Likelihood Decoders. CoRR (2014)
Thijs Laarhoven, Benne de Weger
Optimal symmetric Tardos traitor tracing schemes. Des. Codes Cryptogr. 71 (1) (2014)
Thijs Laarhoven
Sieving for shortest vectors in lattices using angular locality-sensitive hashing. IACR Cryptol. ePrint Arch. 2014 (2014)
Jan-Jaap Oosterwijk, Jeroen Doumen, Thijs Laarhoven
Tuple decoders for traitor tracing schemes. Media Watermarking, Security, and Forensics (2014)
Thijs Laarhoven, Michele Mosca, Joop van de Pol
Finding shortest lattice vectors faster using quantum search. IACR Cryptol. ePrint Arch. 2014 (2014)
Thijs Laarhoven
Asymptotics of Fingerprinting and Group Testing: Tight Bounds from Channel Capacities. CoRR (2014)
Thijs Laarhoven
Capacities and capacity-achieving decoders for various fingerprinting games. IH&MMSec (2014)
Thijs Laarhoven, Benne de Weger
Discrete distributions in the tardos scheme, revisited. IH&MMSec (2013)
Thijs Laarhoven
Efficient probabilistic group testing based on traitor tracing. Allerton (2013)
Thijs Laarhoven
Efficient Probabilistic Group Testing Based on Traitor Tracing. CoRR (2013)
Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Skoric, Benne de Weger
Dynamic Tardos Traitor Tracing Schemes. IEEE Trans. Inf. Theory 59 (7) (2013)
Thijs Laarhoven, Michele Mosca, Joop van de Pol
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search CoRR (2013)
Thijs Laarhoven, Michele Mosca, Joop van de Pol
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search. PQCrypto (2013)
Thijs Laarhoven, Benne de Weger
Discrete Distributions in the Tardos Scheme, Revisited CoRR (2013)
Thijs Laarhoven
Dynamic traitor tracing schemes, revisited. WIFS (2013)
Thijs Laarhoven
Dynamic Traitor Tracing Schemes, Revisited. CoRR (2013)
Thijs Laarhoven, Benne de Weger
The Collatz conjecture and De Bruijn graphs CoRR (2012)
Thijs Laarhoven, Jan-Jaap Oosterwijk, Jeroen Doumen
Dynamic traitor tracing for arbitrary alphabets: Divide and conquer. WIFS (2012)
Thijs Laarhoven, Joop van de Pol, Benne de Weger
Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems. IACR Cryptol. ePrint Arch. 2012 (2012)
Thijs Laarhoven, Jan-Jaap Oosterwijk, Jeroen Doumen
Dynamic Traitor Tracing for Arbitrary Alphabets: Divide and Conquer CoRR (2012)
Thijs Laarhoven, Benne de Weger
Optimal symmetric Tardos traitor tracing schemes CoRR (2011)
Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Skoric, Benne de Weger
Dynamic Tardos Traitor Tracing Schemes CoRR (2011)