Nicolas Resch
Hello! I am an assistant professor with the Theoretical Computer Science Group from the Informatics Institute of the University of Amsterdam (UvA). While I have broad interests in much of theoretical computer science, most of my work focuses on coding theory, cryptography, and their intersection.Prior to joining the UvA, I was a postdoctoral researcher in the Cryptology Group at the Centrum Wiskunde & Informatica (CWI), hosted by Ronald Cramer. I obtained my PhD from Carnegie Mellon University (CMU), where I was fortunate to be advised by Venkatesan Guruswami and Bernhard Haeupler.
Research
Refereed Publications
| Title | Authors | Venue(s) | Links |
|---|---|---|---|
| Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes | Nicolas Resch, Chen Yuan, and Yihan Zhang | ITCS 2025 | full version |
| Generalized Special-Sound Interactive Proofs and their Knowledge Soundness | Thomas Attema, Serge Fehr, and Nicolas Resch | TCC 2023 | full version |
| Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery | Nicolas Resch, Chen Yuan, and Yihan Zhang | ICALP 2023 | full version |
| Two-Round Perfectly Secure Message Transmission with Optimal Rate | Nicolas Resch and Chen Yuan | ITC 2023 | full version |
| Oblivious Transfer with Constant Computational Overhead | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter Scholl | EUROCRYPT 2023 | full version |
| Interactive Coding with Small Memory | Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, and Raghuvansh Saxena | SODA 2023 | full version |
| Correlated Pseudorandomness from Expand-Accumulate Codes | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter Scholl | CRYPTO 2022 | full version, 5 minute video |
| Threshold Rates of Code Ensembles: Linear is Best | Nicolas Resch and Chen Yuan | ICALP 2022 | full version |
| Smoothing Codes and Lattices: Systematic Study and New Bounds | Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, and Jean-Pierre Tillich | IEEE Trans. on Info. Theory | full version |
| Circuits Resilient to Short-Circuit Errors | Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, and Raghuvansh R. Saxena | STOC 2022; invited to SICOMP special issue | full version |
| Sharp threshold rates for random codes | Venkatesan Guruswami, Jonathan Mosheiff, Shashwat Silas, and Mary Wootters | IEEE Trans. on Info. Theory; prelim. version at ITCS 2021 | full version |
| Bounds for list-decoding and list-recovery of random linear codes | Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Shashwat Silas, and Mary Wootters | IEEE Trans. on Info. Theory; prelim. version at RANDOM 2020 | full version |
| LDPC Codes Achieve List Decoding Capacity | Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, and Mary Wootters | FOCS 2020; invited to SICOMP special issue | full version |
| On List Recovery of High-Rate Tensor Codes | Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, and Shashwat Silas | IEEE Trans. on Info. Theory; prelim. version at RANDOM 2018. | full version |
| Lossless dimension expanders via linearized polynomials and subspace designs | Venkatesan Guruswami, Nicolas Resch, and Chaoping Xing | Combinatorica; prelim. version at CCC 2018. | full version |
| On the List-Decodability of Random Linear Rank-Metric Codes | Venkatesan Guruswami and Nicolas Resch | ISIT 2018 | full version |
Unpublished Manuscripts
| Title | Authors | Links |
|---|---|---|
| Blaze: Fast SNARKs from Interleaved RAA Codes | Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, Hadas Zeilberger | full version |
| Interactive Coding with Small Memory and Improved Rate | Dorsa Fathollahi, Bernhard Haeupler, Nicolas Resch, Mary Wootters | full version |
| Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes | Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan | full version |
| The Fiat-Shamir Transformation of (Γ1,...,Γµ)-Special-Sound Interactive Proofs | Thomas Attema, Serge Fehr, Michael Klooß, and Nicolas Resch | full version |
| Worst and Average Case Hardness of Decoding via Smoothing Bounds | Thomas Debris-Alazard and Nicolas Resch | full version |
Teaching
Links for courses I've taught since starting at the UvA.
| Course | Semester | Links |
|---|---|---|
| Modern Cryptography (5062MOCR6Y) | Fall 2024, Period 1 | Canvas |
| Information Theory (5314INTH6Y) | Fall 2023, Period 2 | Canvas |
| Introduction to Information Theory (5122ITSL6Y) | Fall 2023, Period 2 | Canvas |
| Information Theory (5314INTH6Y) | Fall 2022, Period 2 | Canvas |
| Introduction to Information Theory (5122ITSL6Y) | Fall 2022, Period 2 | Canvas |
Supervision
I've had the pleasure of supervising some very talented students.
| Name | Title | Degree | Date | Notes |
|---|---|---|---|---|
| Emiel Wiedijk | Worst-case to Average-case Reductions in Code-Based Cryptography | MSc | Spring 2024 | Cum Laude |
| Martijn Brehm | TBD | PhD | September 2023-Present | |
| Mark Bebawy | Cryptographic Compilers for Linear Probabilistically Checkable Proofs | MSc Thesis | Spring 2023 | Cum Laude |
| Jelle Sipkes | Cryptanalysis of Weak Pseudorandom Functions | Joint Math/CS BSc Thesis | Spring 2023 |
News
I am a 2022 Veni laureate: my proposal titled Secure and Efficient Code-Based Cryptography was selected by the NWO (the Dutch Research Council) to be funded.
I attended the Simons Institute program Error-Correcting Codes: Theory and Practice from January-May, 2024.
Contact
Office address: L6.08 in LAB42, Science Park 900, 1098 XH Amsterdam
Email address: n [dot] a [dot] resch [at] uva [dot] nl, or click link below