209 citations · 489 across the 24 of their papers we have counts for
11 papers · 1 filter
Dual lattice attacks for bounded distance decoding, revisited
Thijs Laarhoven
Analyses of dual lattice attacks have often assumed that the individual scores associated with short dual vectors are mutually independent. Laarhoven-Walter used this heuristic to…
Smooth Sailing through Spherical Shells: Provable Random-Lattice Sieving in Time
Emmanouil Doulgerakis, Thijs Laarhoven
In an attempt to close the gap between the best provable and heuristic algorithms for hard lattice problems, such as the shortest (SVP) and closest vector problem (CVP), we analyze…
Nearest neighbor decoding for Tardos fingerprinting codes
Thijs Laarhoven
Over the past decade, various improvements have been made to Tardos' collusion-resistant fingerprinting scheme [Tardos, STOC 2003], ultimately resulting in a good understanding of…
Sieving for closest lattice vectors (with preprocessing)
Thijs Laarhoven
Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-quantum cryptography. The two main hard problems underlying its security are the…
Optimal sequential fingerprinting: Wald vs. Tardos
Thijs Laarhoven
We study sequential collusion-resistant fingerprinting, where the fingerprinting code is generated in advance but accusations may be made between rounds, and show that in this sett…
Dynamic Traitor Tracing Schemes, Revisited
Thijs Laarhoven
We revisit recent results from the area of collusion-resistant traitor tracing, and show how they can be combined and improved to obtain more efficient dynamic traitor tracing sche…
Discrete Distributions in the Tardos Scheme, Revisited
Thijs Laarhoven, Benne de Weger
The Tardos scheme is a well-known traitor tracing scheme to protect copyrighted content against collusion attacks. The original scheme contained some suboptimal design choices, suc…
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
Thijs Laarhoven, Michele Mosca, Joop van de Pol
By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehlé, we obtain improved asympt…
Dynamic Traitor Tracing for Arbitrary Alphabets: Divide and Conquer
Thijs Laarhoven, Jan-Jaap Oosterwijk, Jeroen Doumen
We give a generic divide-and-conquer approach for constructing collusion-resistant probabilistic dynamic traitor tracing schemes with larger alphabets from schemes with smaller alp…
Dynamic Tardos Traitor Tracing Schemes
Thijs Laarhoven, Jeroen Doumen, Peter Roelse +2
We construct binary dynamic traitor tracing schemes, where the number of watermark bits needed to trace and disconnect any coalition of pirates is quadratic in the number of pirate…
Optimal symmetric Tardos traitor tracing schemes
Thijs Laarhoven, Benne de Weger
For the Tardos traitor tracing scheme, we show that by combining the symbol-symmetric accusation function of Skoric et al. with the improved analysis of Blayer and Tassa we get fur…