Thijs Laarhoven
Thijs Laarhoven
Eindhoven University of Technology
Geverifieerd e-mailadres voor berkeley.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Practical and optimal LSH for the angular distance
A Andoni, P Indyk, T Laarhoven, I Razenshteyn, L Schmidt
NeurIPS 2015, 2015
3382015
New directions in nearest neighbor searching with applications to lattice sieving
A Becker, L Ducas, N Gama, T Laarhoven
SODA 2016, 2016
2452016
Sieving for shortest vectors in lattices using angular locality-sensitive hashing
T Laarhoven
Crypto 2015, 2015
1392015
Optimal hashing-based time-space trade-offs for approximate near neighbors
A Andoni, T Laarhoven, I Razenshteyn, E Waingarten
SODA 2017, 2017
1182017
Finding shortest lattice vectors faster using quantum search
T Laarhoven, M Mosca, J van de Pol
Designs, Codes and Cryptography 77 (2), 375-400, 2015
1012015
Round5: Compact and fast post-quantum public-key encryption
S Bhattacharya, O Garcia-Morchon, T Laarhoven, R Rietman, ...
PQCrypto 2019, 2019
97*2019
Search problems in cryptography
T Laarhoven
PhD thesis, Eindhoven University of Technology, 2016
85*2016
Tuple lattice sieving
S Bai, T Laarhoven, D Stehlé
ANTS 2016, 2016
452016
Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
T Laarhoven, B de Weger
Latincrypt 2015, 2015
432015
Solving hard lattice problems and the security of lattice-based cryptosystems
T Laarhoven, J van de Pol, B de Weger
Cryptology ePrint Archive, Report 2012/533, 2012
432012
Efficient (ideal) lattice sieving using cross-polytope LSH
A Becker, T Laarhoven
Africacrypt 2016, 2016
412016
Progressive lattice sieving
T Laarhoven, A Mariano
PQCrypto 2018, 2018
402018
Optimal symmetric Tardos traitor tracing schemes
T Laarhoven, B de Weger
Designs, Codes and Cryptography 71 (1), 83-103, 2014
38*2014
Dynamic Tardos traitor tracing schemes
T Laarhoven, J Doumen, P Roelse, B Skoric, B de Weger
IEEE Transactions on Information Theory 59 (7), 4230-4242, 2013
352013
Solving the shortest vector problem in lattices faster using quantum search
T Laarhoven, M Mosca, J van de Pol
PQCrypto 2013, 2013
342013
Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP
A Mariano, T Laarhoven, C Bischof
ICPP 2015, 2015
332015
A parallel variant of LDSieve for the SVP on lattices
A Mariano, T Laarhoven, C Bischof
PDP 2017, 2017
282017
Speed-ups and time-memory trade-offs for tuple lattice sieving
G Herold, E Kirshanova, T Laarhoven
PKC 2018, 2018
26*2018
Finding closest lattice vectors using approximate Voronoi cells
E Doulgerakis, T Laarhoven, B De Weger
PQCrypto 2019, 2019
23*2019
Asymptotics of fingerprinting and group testing: Tight bounds from channel capacities
T Laarhoven
IEEE Transactions on Information Forensics and Security 10 (9), 1967-1980, 2015
232015
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20