Nicolas Resch
Hello! I am an assistant professor with the Theoretical Computer Science Group from the Informatics' Institute of the University of Amsterdam. While I have broad interests in much of theoretical computer science, most of my work focuses on coding theory (protecting data from errors), cryptography (protecting data from bad guys) 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, where I learned most of what I know about cryptography. I obtained my PhD from Carnegie Mellon University (CMU), where I was fortunate to be advised by Venkatesan Guruswami and Bernhard Haeupler. There, I mostly focused on coding theory and related notions in pseudorandomness.
Teaching
- Fall 2022, Block 2: Information Theory and Introduction to Information Theory (taught simulataneously).
Research
- Oblivious Transfer with Constant Computational Overhead. Eurocrypt 2023. With Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl.
- Interactive Coding with Small Memory. SODA 2023. With Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, and Raghuvansh Saxena.
- Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. In Submission. With Chen Yuan, and Yihan Zhang.
- Correlated Pseudorandomness from Expand-Accumulate Codes. CRYPTO 2022. With Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl.
- Threshold Rates of Code Ensembles: Linear is Best. ICALP 2022. With Chen Yuan.
- Smoothing Codes and Lattices: Systematic Study and New Bounds. In Submission. With Thomas Debris-Alazard, Léo Ducas, and Jean-Pierre Tillich.
- Circuits Resilient to Short-Circuit Errors. STOC 2022. Invited to STOC special issue at SICOMP. With Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, and Raghuvansh R. Saxena.
- Two-Round Perfectly Secure Message Transmission with Optimal Rate. In Submission. With Chen Yuan.
- Sharp threshold rates for random codes. IEEE Transactions on Information Theory 2021. Preliminary version at ITCS 2021. With Venkatesan Guruswami, Jonathan Mosheiff, Shashwat Silas, and Mary Wootters.
- Bounds for list-decoding and list-recovery of random linear codes. IEEE Transactions on Information Theory 2021. Preliminary version at RANDOM 2020. With Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Shashwat Silas, and Mary Wootters.
- LDPC Codes Achieve List Decoding Capacity. FOCS 2020. Invited to FOCS special issue at SICOMP. With Jonathan Mosheiff, Noga Ron-Zewi, Shashwat Silas, and Mary Wootters.
- On List Recovery of High-Rate Tensor Codes. IEEE Transactions on Information Theory 2020. Preliminary version at RANDOM 2018. With Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas.
- Lossless dimension expanders via linearized polynomials and subspace designs. Combinatorica. Preliminary Version in CCC 2018. With Venkatesan Guruswami and Chaoping Xing.
- On the List-Decodability of Random Linear Rank-Metric Codes. ISIT 2018. With Venkatesan Guruswami.
- List-Decodable Codes: (Randomized) Constructions and Applications. PhD Thesis. May 2020.
Contact
Email address: n.a.resch [at] uva [dot] nl
Office: LAB42 L6.08
