Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarThijs Laarhoven
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[c20]Gottfried Herold, Elena Kirshanova, Thijs Laarhoven:
Speed-Ups and Time-Memory Trade-Offs for Tuple Lattice Sieving. Public Key Cryptography (1) 2018: 407-436- [c19]
- [i33]Thijs Laarhoven, Artur Mariano:
Progressive lattice sieving. IACR Cryptology ePrint Archive 2018: 79 (2018) - 2017
- [j6]Artur Mariano, Thijs Laarhoven, Fábio Correia, Manuel Rodrigues, Gabriel Falcão:
A Practical View of the State-of-the-Art of Lattice-Based Cryptanalysis. IEEE Access 5: 24184-24202 (2017) - [c18]
- [c17]Artur Mariano, Thijs Laarhoven, Christian H. Bischof:
A Parallel Variant of LDSieve for the SVP on Lattices. PDP 2017: 23-30 - [c16]Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten:
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. SODA 2017: 47-66 - [i32]
- [i31]Thijs Laarhoven:
Faster tuple lattice sieving using spherical locality-sensitive filters. CoRR abs/1705.02828 (2017) - [i30]Thijs Laarhoven:
Graph-based time-space trade-offs for approximate near neighbors. CoRR abs/1712.03158 (2017) - [i29]Gottfried Herold, Elena Kirshanova, Thijs Laarhoven:
Speed-ups and time-memory trade-offs for tuple lattice sieving. IACR Cryptology ePrint Archive 2017: 1228 (2017) - 2016
- [j5]Thijs Laarhoven:
Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders. EURASIP J. Information Security 2016: 3 (2016) - [c15]Anja Becker, Thijs Laarhoven:
Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH. AFRICACRYPT 2016: 3-23 - [c14]
- [c13]Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven:
New directions in nearest neighbor searching with applications to lattice sieving. SODA 2016: 10-24 - [i28]Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten:
Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors. CoRR abs/1605.02701 (2016) - [i27]Thijs Laarhoven:
Sieving for closest lattice vectors (with preprocessing). CoRR abs/1607.04789 (2016) - [i26]Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten:
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. CoRR abs/1608.03580 (2016) - [i25]Shi Bai, Thijs Laarhoven, Damien Stehlé:
Tuple lattice sieving. IACR Cryptology ePrint Archive 2016: 713 (2016) - [i24]Thijs Laarhoven:
Randomized lattice sieving for the closest vector problem (with preprocessing). IACR Cryptology ePrint Archive 2016: 888 (2016) - [i23]Artur Mariano, Thijs Laarhoven, Christian H. Bischof:
A Parallel Variant of LDSieve for the SVP on Lattices. IACR Cryptology ePrint Archive 2016: 890 (2016) - 2015
- [j4]Thijs Laarhoven, Michele Mosca, Joop van de Pol:
Finding shortest lattice vectors faster using quantum search. Des. Codes Cryptography 77(2-3): 375-400 (2015) - [j3]Thijs Laarhoven:
Asymptotics of Fingerprinting and Group Testing: Tight Bounds From Channel Capacities. IEEE Trans. Information Forensics and Security 10(9): 1967-1980 (2015) - [c12]Thijs Laarhoven:
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing. CRYPTO (1) 2015: 3-22 - [c11]Artur Mariano, Christian H. Bischof, Thijs Laarhoven:
Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP. ICPP 2015: 590-599 - [c10]
- [c9]Thijs Laarhoven, Benne de Weger:
Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing. LATINCRYPT 2015: 101-118 - [c8]Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt:
Practical and Optimal LSH for Angular Distance. NIPS 2015: 1225-1233 - [i22]
- [i21]Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt:
Practical and Optimal LSH for Angular Distance. CoRR abs/1509.02897 (2015) - [i20]
- [i19]Artur Mariano, Thijs Laarhoven, Christian H. Bischof:
Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP. IACR Cryptology ePrint Archive 2015: 41 (2015) - [i18]Thijs Laarhoven, Benne de Weger:
Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing. IACR Cryptology ePrint Archive 2015: 211 (2015) - [i17]Anja Becker, Thijs Laarhoven:
Efficient (ideal) lattice sieving using cross-polytope LSH. IACR Cryptology ePrint Archive 2015: 823 (2015) - [i16]Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven:
New directions in nearest neighbor searching with applications to lattice sieving. IACR Cryptology ePrint Archive 2015: 1128 (2015) - 2014
- [j2]Thijs Laarhoven, Benne de Weger:
Optimal symmetric Tardos traitor tracing schemes. Des. Codes Cryptography 71(1): 83-103 (2014) - [c7]Thijs Laarhoven:
Capacities and capacity-achieving decoders for various fingerprinting games. IH&MMSec 2014: 123-134 - [c6]Jan-Jaap Oosterwijk, Jeroen Doumen, Thijs Laarhoven:
Tuple decoders for traitor tracing schemes. Media Watermarking, Security, and Forensics 2014: 90280C - [i15]Thijs Laarhoven:
Capacities and Capacity-Achieving Decoders for Various Fingerprinting Games. CoRR abs/1401.5688 (2014) - [i14]Thijs Laarhoven:
Asymptotics of Fingerprinting and Group Testing: Tight Bounds from Channel Capacities. CoRR abs/1404.2576 (2014) - [i13]Thijs Laarhoven:
Asymptotics of Fingerprinting and Group Testing: Capacity-Achieving Log-Likelihood Decoders. CoRR abs/1404.2825 (2014) - [i12]Jan-Jaap Oosterwijk, Jeroen Doumen, Thijs Laarhoven:
Tuple decoders for traitor tracing schemes. IACR Cryptology ePrint Archive 2014: 166 (2014) - [i11]Thijs Laarhoven:
Sieving for shortest vectors in lattices using angular locality-sensitive hashing. IACR Cryptology ePrint Archive 2014: 744 (2014) - [i10]Thijs Laarhoven, Michele Mosca, Joop van de Pol:
Finding shortest lattice vectors faster using quantum search. IACR Cryptology ePrint Archive 2014: 907 (2014) - 2013
- [j1]Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Skoric, Benne de Weger:
Dynamic Tardos Traitor Tracing Schemes. IEEE Trans. Information Theory 59(7): 4230-4242 (2013) - [c5]Thijs Laarhoven:
Efficient probabilistic group testing based on traitor tracing. Allerton 2013: 1458-1465 - [c4]Thijs Laarhoven, Benne de Weger:
Discrete distributions in the tardos scheme, revisited. IH&MMSec 2013: 13-18 - [c3]Thijs Laarhoven, Michele Mosca, Joop van de Pol:
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search. PQCrypto 2013: 83-101 - [c2]
- [i9]Thijs Laarhoven, Michele Mosca, Joop van de Pol:
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search. CoRR abs/1301.6176 (2013) - [i8]Thijs Laarhoven, Benne de Weger:
Discrete Distributions in the Tardos Scheme, Revisited. CoRR abs/1302.1741 (2013) - [i7]
- [i6]Thijs Laarhoven:
Efficient Probabilistic Group Testing Based on Traitor Tracing. CoRR abs/1307.2438 (2013) - 2012
- [c1]Thijs Laarhoven, Jan-Jaap Oosterwijk, Jeroen Doumen:
Dynamic traitor tracing for arbitrary alphabets: Divide and conquer. WIFS 2012: 240-245 - [i5]Thijs Laarhoven, Jan-Jaap Oosterwijk, Jeroen Doumen:
Dynamic Traitor Tracing for Arbitrary Alphabets: Divide and Conquer. CoRR abs/1206.6720 (2012) - [i4]Thijs Laarhoven, Benne de Weger:
The Collatz conjecture and De Bruijn graphs. CoRR abs/1209.3495 (2012) - [i3]Thijs Laarhoven, Joop van de Pol, Benne de Weger:
Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems. IACR Cryptology ePrint Archive 2012: 533 (2012) - 2011
- [i2]Thijs Laarhoven, Benne de Weger:
Optimal symmetric Tardos traitor tracing schemes. CoRR abs/1107.3441 (2011) - [i1]Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Skoric, Benne de Weger:
Dynamic Tardos Traitor Tracing Schemes. CoRR abs/1111.3597 (2011)
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-15 23:15 CEST by the dblp team