That's me!

Thijs Laarhoven

Postdoctoral researcher at IBM Research

LinkedIn Facebook Twitter Google Plus
Address:



E-mail:
Website:
IBM Research — Zürich
Säumerstrasse 4
CH-8803 Rüschlikon
Switzerland
mail@thijs.com
http://thijs.com

Below is a list of all publications, with links to slides presented at the conference explaining the contents (if available), a freely accessible pdf-version of the manuscript, and a link to the official source of the publication. This list is updated regularly. Publications are grouped by type: Preprints, conference proceedings, journal papers, patents, and theses. Partial overviews of these publications can also be found on the arXiv and the DBLP-server.

An alphabetical list of my co-authors with links to their homepages: Alexandr Andoni, Shi Bai, Anja Becker, Christian Bischof, Jeroen Doumen, Léo Ducas, Nicolas Gama, Piotr Indyk, Artur Mariano, Michele Mosca, Jan-Jaap Oosterwijk, Joop van de Pol, Ilya Razenshteyn, Peter Roelse, Ludwig Schmidt, Boris Škorić, Damien Stehlé, Erik Waingarten, Benne de Weger.


Preprints

  • Hypercube LSH for approximate near neighbors
    pdf link

    Thijs Laarhoven
    Preprint, February 2017
  • Finding closest lattice vectors using approximate Voronoi cells
    pdf link

    Thijs Laarhoven
    Preprint, December 2016
  • Tradeoffs for nearest neighbors on the sphere
    pdf link

    Thijs Laarhoven
    Preprint, November 2015
    The results for "sparse" data sets are also contained in the more recent SODA 2017 paper
  • Solving hard lattice problems and the security of lattice-based cryptosystems
    pdf link

    Thijs Laarhoven, Joop van de Pol, Benne de Weger

    Eternal preprint, September 2012

Conference papers

  • A parallel variant of LDSieve for the SVP on lattices
    pdf link

    Artur Mariano, Thijs Laarhoven, Christian Bischof
    PDP 2017
  • Optimal hashing-based time-space trade-offs for approximate near neighbors
    pdf link

    Alexandr Andoni, Thijs Laarhoven, Ilya Razenshteyn, Erik Waingarten
    SODA 2017
    Invited to the ACM Transactions on Algorithms
  • Sieving for closest lattice vectors (with preprocessing)
    slides pdf link

    Thijs Laarhoven
    SAC 2016

  • Tuple lattice sieving
    pdf link code

    Shi Bai, Thijs Laarhoven, Damien Stehlé
    ANTS 2016
  • Efficient (ideal) lattice sieving using cross-polytope LSH
    pdf link code

    Anja Becker, Thijs Laarhoven
    AFRICACRYPT 2016
  • New directions in nearest neighbor searching with applications to lattice sieving
    slides pdf link code

    Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven
    SODA 2016
  • Practical and optimal LSH for the angular distance
    pdf link code

    Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya Razenshteyn, Ludwig Schmidt
    NIPS 2015
  • Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP
    pdf link

    Artur Mariano, Thijs Laarhoven, Christian Bischof
    ICPP 2015
  • Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
    slides pdf link

    Thijs Laarhoven, Benne de Weger
    LATINCRYPT 2015
  • Sieving for shortest vectors in lattices using angular locality-sensitive hashing
    slides pdf link code

    Thijs Laarhoven
    CRYPTO 2015
  • Optimal sequential fingerprinting: Wald vs. Tardos
    slides pdf link

    Thijs Laarhoven
    IH&MMSec 2015
    Best Paper Award
  • Capacities and capacity-achieving decoders for various fingerprinting games
    slides pdf link

    Thijs Laarhoven
    IH&MMSec 2014
    Best Student Paper Award
  • Tuple decoders for traitor tracing schemes
    pdf link

    Jan-Jaap Oosterwijk, Jeroen Doumen, Thijs Laarhoven
    SPIE Electronic Imaging 2014
  • Dynamic traitor tracing schemes, revisited
    slides pdf link

    Thijs Laarhoven
    WIFS 2013
  • Efficient probabilistic group testing based on traitor tracing
    slides pdf link

    Thijs Laarhoven
    ALLERTON 2013
  • Discrete distributions in the Tardos scheme, revisited
    slides pdf link

    Thijs Laarhoven, Benne de Weger
    IH&MMSec 2013
  • Solving the shortest vector problem in lattices faster using quantum search
    slides pdf link

    Thijs Laarhoven, Michele Mosca, Joop van de Pol
    PQCrypto 2013
  • Dynamic traitor tracing for arbitrary alphabets: Divide and conquer
    slides pdf link

    Thijs Laarhoven, Jan-Jaap Oosterwijk, Jeroen Doumen
    WIFS 2012
    Best Paper Award

Journal articles

  • Asymptotics of fingerprinting and group testing: Capacity-achieving log-likelihood decoders
    pdf link

    Thijs Laarhoven
    EURASIP Journal on Information Security 2016
  • Asymptotics of fingerprinting and group testing: Tight bounds from channel capacities
    pdf link

    Thijs Laarhoven
    IEEE Transactions on Information Forensics and Security 2015
  • Finding shortest lattice vectors faster using quantum search
    pdf link

    Thijs Laarhoven, Michele Mosca, Joop van de Pol
    Designs, Codes and Cryptography 2015
  • Optimal symmetric Tardos traitor tracing schemes
    pdf link

    Thijs Laarhoven, Benne de Weger
    Designs, Codes and Cryptography 2014
  • The Collatz conjecture and De Bruijn graphs
    pdf link

    Thijs Laarhoven, Benne de Weger
    Indagationes Mathematicae 2013
  • Dynamic Tardos traitor tracing schemes
    pdf link

    Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Škorić, Benne de Weger
    IEEE Transactions on Information Theory 2013

Patents

  • Dynamic Tardos traitor tracing schemes
    PDF @ WIPO link

    Peter Roelse, Jeroen Doumen, Thijs Laarhoven
    Patent no. EP2012058033, Irdeto Corporate BV, December 2012.

Theses

  • Search problems in cryptography
    slides pdf link

    Thijs Laarhoven
    Dissertation, December 2015.
  • Collusion-resistant traitor tracing schemes
    slides pdf link

    Thijs Laarhoven
    Masters Thesis, July 2011.
  • The 3n+1 conjecture
    slides pdf link

    Thijs Laarhoven
    Bachelors Thesis, July 2009.