Thijs Laarhoven

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