Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDThijs Laarhoven
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j7]Thijs Laarhoven:
Approximate Voronoi cells for lattices, revisited. J. Math. Cryptol. 15(1): 60-71 (2021)- [c30]Elena Kirshanova, Thijs Laarhoven:
Lower Bounds on Lattice Sieving and Information Set Decoding. CRYPTO (2) 2021: 791-820 - [c29]Thijs Laarhoven
, Michael Walter:
Dual Lattice Attacks for Closest Vector Problems (with Preprocessing). CT-RSA 2021: 478-502 - [i44]Thijs Laarhoven, Michael Walter:
Dual lattice attacks for closest vector problems (with preprocessing). IACR Cryptol. ePrint Arch. 2021: 557 (2021) - [i43]Elena Kirshanova, Thijs Laarhoven:
Lower bounds on lattice sieving and information set decoding. IACR Cryptol. ePrint Arch. 2021: 785 (2021) - [i42]Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger:
The irreducible vectors of a lattice: Some theory and applications. IACR Cryptol. ePrint Arch. 2021: 1203 (2021) - 2020
- [c28]Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger:
Sieve, Enumerate, Slice, and Lift: - Hybrid Lattice Algorithms for SVP via CVPP. AFRICACRYPT 2020: 301-320 - [c27]Thijs Laarhoven:
Polytopes, Lattices, and Spherical Codes for the Nearest Neighbor Problem. ICALP 2020: 76:1-76:14 - [c26]Léo Ducas, Thijs Laarhoven, Wessel P. J. van Woerden:
The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier. Public Key Cryptography (2) 2020: 3-36 - [i41]Léo Ducas, Thijs Laarhoven, Wessel P. J. van Woerden:
The randomized slicer for CVPP: sharper, faster, smaller, batchier. IACR Cryptol. ePrint Arch. 2020: 120 (2020) - [i40]Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger:
Sieve, Enumerate, Slice, and Lift: Hybrid Lattice Algorithms for SVP via CVPP. IACR Cryptol. ePrint Arch. 2020: 487 (2020)
2010 – 2019
- 2019
- [c25]Thijs Laarhoven:
Nearest Neighbor Decoding for Tardos Fingerprinting Codes. IH&MMSec 2019: 182-187 - [c24]Thijs Laarhoven:
Evolutionary Techniques in Lattice Sieving Algorithms. IJCCI 2019: 31-39 - [c23]Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger:
Finding Closest Lattice Vectors Using Approximate Voronoi Cells. PQCrypto 2019: 3-22 - [c22]Hayo Baan, Sauvik Bhattacharya, Scott R. Fluhrer, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang:
Round5: Compact and Fast Post-quantum Public-Key Encryption. PQCrypto 2019: 83-102 - [i39]Thijs Laarhoven:
Nearest neighbor decoding for Tardos fingerprinting codes. CoRR abs/1902.06196 (2019) - [i38]Thijs Laarhoven:
Polytopes, lattices, and spherical codes for the nearest neighbor problem. CoRR abs/1907.04628 (2019) - [i37]Thijs Laarhoven:
Evolutionary techniques in lattice sieving algorithms. CoRR abs/1907.04629 (2019) - [i36]Thijs Laarhoven:
Approximate Voronoi cells for lattices, revisited. CoRR abs/1907.04630 (2019) - [i35]Hayo Baan, Sauvik Bhattacharya, Scott R. Fluhrer, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang:
Round5: Compact and Fast Post-Quantum Public-Key Encryption. IACR Cryptol. ePrint Arch. 2019: 90 (2019) - 2018
- [c21]Thijs Laarhoven:
Graph-Based Time-Space Trade-Offs for Approximate Near Neighbors. SoCG 2018: 57:1-57:14 - [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]Thijs Laarhoven, Artur Mariano:
Progressive Lattice Sieving. PQCrypto 2018: 292-311 - [i34]Thijs Laarhoven, Artur Mariano:
Progressive lattice sieving. IACR Cryptol. ePrint Arch. 2018: 79 (2018) - [i33]Sauvik Bhattacharya, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang:
Round5: Compact and Fast Post-Quantum Public-Key Encryption. IACR Cryptol. ePrint Arch. 2018: 725 (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]Thijs Laarhoven:
Hypercube LSH for Approximate near Neighbors. MFCS 2017: 7:1-7:20 - [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]Thijs Laarhoven:
Hypercube LSH for approximate near neighbors. CoRR abs/1702.05760 (2017) - [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 Cryptol. ePrint Arch. 2017: 1228 (2017) - 2016
- [j5]Thijs Laarhoven:
Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders. EURASIP J. Inf. Secur. 2016: 3 (2016) - [c15]Anja Becker, Thijs Laarhoven:
Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH. AFRICACRYPT 2016: 3-23 - [c14]Thijs Laarhoven:
Sieving for Closest Lattice Vectors (with Preprocessing). SAC 2016: 523-542 - [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 Cryptol. ePrint Arch. 2016: 713 (2016) - [i24]Thijs Laarhoven:
Randomized lattice sieving for the closest vector problem (with preprocessing). IACR Cryptol. ePrint Arch. 2016: 888 (2016) - [i23]Artur Mariano, Thijs Laarhoven, Christian H. Bischof:
A Parallel Variant of LDSieve for the SVP on Lattices. IACR Cryptol. ePrint Arch. 2016: 890 (2016) - 2015
- [j4]Thijs Laarhoven, Michele Mosca, Joop van de Pol:
Finding shortest lattice vectors faster using quantum search. Des. Codes Cryptogr. 77(2-3): 375-400 (2015) - [j3]Thijs Laarhoven:
Asymptotics of Fingerprinting and Group Testing: Tight Bounds From Channel Capacities. IEEE Trans. Inf. Forensics Secur. 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]Thijs Laarhoven:
Optimal Sequential Fingerprinting: Wald vs. Tardos. IH&MMSec 2015: 97-107 - [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]Thijs Laarhoven:
Optimal sequential fingerprinting: Wald vs. Tardos. CoRR abs/1502.03722 (2015) - [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]Thijs Laarhoven:
Tradeoffs for nearest neighbors on the sphere. CoRR abs/1511.07527 (2015) - [i19]Artur Mariano, Thijs Laarhoven, Christian H. Bischof:
Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP. IACR Cryptol. ePrint Arch. 2015: 41 (2015) - [i18]Thijs Laarhoven, Benne de Weger:
Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing. IACR Cryptol. ePrint Arch. 2015: 211 (2015) - [i17]Anja Becker, Thijs Laarhoven:
Efficient (ideal) lattice sieving using cross-polytope LSH. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2015: 1128 (2015) - 2014
- [j2]Thijs Laarhoven, Benne de Weger:
Optimal symmetric Tardos traitor tracing schemes. Des. Codes Cryptogr. 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 Cryptol. ePrint Arch. 2014: 166 (2014) - [i11]Thijs Laarhoven:
Sieving for shortest vectors in lattices using angular locality-sensitive hashing. IACR Cryptol. ePrint Arch. 2014: 744 (2014) - [i10]Thijs Laarhoven, Michele Mosca, Joop van de Pol:
Finding shortest lattice vectors faster using quantum search. IACR Cryptol. ePrint Arch. 2014: 907 (2014) - 2013
- [j1]Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Skoric, Benne de Weger:
Dynamic Tardos Traitor Tracing Schemes. IEEE Trans. Inf. 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]Thijs Laarhoven:
Dynamic traitor tracing schemes, revisited. WIFS 2013: 191-196 - [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]Thijs Laarhoven:
Dynamic Traitor Tracing Schemes, Revisited. CoRR abs/1307.0214 (2013) - [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 Cryptol. ePrint Arch. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-03-20 21:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
