Thijs Laarhoven

According to our database, Thijs Laarhoven authored at least 49 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

The irreducible vectors of a lattice.

Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger

Des. Codes Cryptogr., February, 2023

2022

Towards Transparent Cheat Detection in Online Chess: An Application of Human and Computer Decision-Making Preferences.

Thijs Laarhoven, Aditya Ponukumati

Proceedings of the Computers and Games - International Conference, 2022

2021

Approximate Voronoi cells for lattices, revisited.

Thijs Laarhoven

J. Math. Cryptol., 2021

Dual lattice attacks for closest vector problems (with preprocessing).

Thijs Laarhoven, Michael Walter

IACR Cryptol. ePrint Arch., 2021

Lower bounds on lattice sieving and information set decoding.

Elena Kirshanova, Thijs Laarhoven

IACR Cryptol. ePrint Arch., 2021

The irreducible vectors of a lattice: Some theory and applications.

Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger

IACR Cryptol. ePrint Arch., 2021

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

Sieve, Enumerate, Slice, and Lift: Hybrid Lattice Algorithms for SVP via CVPP.

Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger

IACR Cryptol. ePrint Arch., 2020

Polytopes, Lattices, and Spherical Codes for the Nearest Neighbor Problem.

Thijs Laarhoven

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

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

Finding Closest Lattice Vectors Using Approximate Voronoi Cells.

Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger

Proceedings of the Post-Quantum Cryptography - 10th International Conference, 2019

Evolutionary Techniques in Lattice Sieving Algorithms.

Thijs Laarhoven

Proceedings of the 11th International Joint Conference on Computational Intelligence, 2019

Nearest Neighbor Decoding for Tardos Fingerprinting Codes.

Thijs Laarhoven

Proceedings of the ACM Workshop on Information Hiding and Multimedia Security, 2019

2018

Progressive lattice sieving.

Thijs Laarhoven, Artur Mariano

IACR Cryptol. ePrint Arch., 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

Graph-Based Time-Space Trade-Offs for Approximate Near Neighbors.

Thijs Laarhoven

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Speed-ups and time-memory trade-offs for tuple lattice sieving.

Gottfried Herold, Elena Kirshanova, Thijs Laarhoven

IACR Cryptol. ePrint Arch., 2017

Faster tuple lattice sieving using spherical locality-sensitive filters.

Thijs Laarhoven

CoRR, 2017

A Practical View of the State-of-the-Art of Lattice-Based Cryptanalysis.

Artur Mariano, Thijs Laarhoven, Fábio Correia, Manuel Rodrigues, Gabriel Falcão

IEEE Access, 2017

Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors.

Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Hypercube LSH for Approximate near Neighbors.

Thijs Laarhoven

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Tuple lattice sieving.

Shi Bai, Thijs Laarhoven, Damien Stehlé

LMS J. Comput. Math., 2016

A Parallel Variant of LDSieve for the SVP on Lattices.

Artur Mariano, Thijs Laarhoven, Christian H. Bischof

IACR Cryptol. ePrint Arch., 2016

Randomized lattice sieving for the closest vector problem (with preprocessing).

Thijs Laarhoven

IACR Cryptol. ePrint Arch., 2016

Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders.

Thijs Laarhoven

EURASIP J. Inf. Secur., 2016

Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors.

Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten

CoRR, 2016

Sieving for Closest Lattice Vectors (with Preprocessing).

Thijs Laarhoven

Proceedings of the Selected Areas in Cryptography - SAC 2016, 2016

2015

Asymptotics of Fingerprinting and Group Testing: Tight Bounds From Channel Capacities.

Thijs Laarhoven

IEEE Trans. Inf. Forensics Secur., 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

Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing.

Thijs Laarhoven, Benne de Weger

IACR Cryptol. ePrint Arch., 2015

Efficient (ideal) lattice sieving using cross-polytope LSH.

Anja Becker, Thijs Laarhoven

IACR Cryptol. ePrint Arch., 2015

New directions in nearest neighbor searching with applications to lattice sieving.

Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven

IACR Cryptol. ePrint Arch., 2015

Finding shortest lattice vectors faster using quantum search.

Thijs Laarhoven, Michele Mosca, Joop van de Pol

Des. Codes Cryptogr., 2015

Tradeoffs for nearest neighbors on the sphere.

Thijs Laarhoven

CoRR, 2015

Practical and Optimal LSH for Angular Distance.

Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Optimal Sequential Fingerprinting: Wald vs. Tardos.

Thijs Laarhoven

Proceedings of the 3rd ACM Workshop on Information Hiding and Multimedia Security, 2015

Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP.

Artur Mariano, Christian H. Bischof, Thijs Laarhoven

Proceedings of the 44th International Conference on Parallel Processing, 2015

2014

Tuple decoders for traitor tracing schemes.

Jan-Jaap Oosterwijk, Jeroen Doumen, Thijs Laarhoven

IACR Cryptol. ePrint Arch., 2014

Sieving for shortest vectors in lattices using angular locality-sensitive hashing.

Thijs Laarhoven

IACR Cryptol. ePrint Arch., 2014

Optimal symmetric Tardos traitor tracing schemes.

Thijs Laarhoven, Benne de Weger

Des. Codes Cryptogr., 2014

Capacities and capacity-achieving decoders for various fingerprinting games.

Thijs Laarhoven

Proceedings of the ACM Information Hiding and Multimedia Security Workshop, 2014

2013

Dynamic Tardos Traitor Tracing Schemes.

Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Skoric, Benne de Weger

IEEE Trans. Inf. Theory, 2013

Dynamic traitor tracing schemes, revisited.

Thijs Laarhoven

Proceedings of the 2013 IEEE International Workshop on Information Forensics and Security, 2013

Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search.

Thijs Laarhoven, Michele Mosca, Joop van de Pol

Proceedings of the Post-Quantum Cryptography - 5th International Workshop, 2013

Discrete distributions in the tardos scheme, revisited.

Thijs Laarhoven, Benne de Weger

Proceedings of the ACM Information Hiding and Multimedia Security Workshop, 2013

Efficient probabilistic group testing based on traitor tracing.

Thijs Laarhoven

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

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

The Collatz conjecture and De Bruijn graphs

Thijs Laarhoven, Benne de Weger

CoRR, 2012

Dynamic traitor tracing for arbitrary alphabets: Divide and conquer.

Thijs Laarhoven, Jan-Jaap Oosterwijk, Jeroen Doumen

Proceedings of the 2012 IEEE International Workshop on Information Forensics and Security, 2012