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

TitleAuthorsVenue(s)Links
Generalized Special-Sound Interactive Proofs and their Knowledge SoundnessThomas Attema, Serge Fehr, and Nicolas ReschTCC 2023full version
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-RecoveryNicolas Resch, Chen Yuan, and Yihan ZhangICALP 2023full version
Two-Round Perfectly Secure Message Transmission with Optimal RateNicolas Resch and Chen YuanITC 2023full version
Oblivious Transfer with Constant Computational OverheadElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter SchollEUROCRYPT 2023full version
Interactive Coding with Small MemoryKlim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, and Raghuvansh SaxenaSODA 2023full version
Correlated Pseudorandomness from Expand-Accumulate CodesElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter SchollCRYPTO 2022full version,
5 minute video
Threshold Rates of Code Ensembles: Linear is BestNicolas Resch and Chen YuanICALP 2022full version
Smoothing Codes and Lattices: Systematic Study and New BoundsThomas Debris-Alazard, Léo Ducas, Nicolas Resch, and Jean-Pierre TillichIEEE Trans. on Info. Theoryfull version
Circuits Resilient to Short-Circuit ErrorsKlim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, and Raghuvansh R. SaxenaSTOC 2022; invited to SICOMP special issuefull version
Sharp threshold rates for random codesVenkatesan Guruswami, Jonathan Mosheiff, Shashwat Silas, and Mary WoottersIEEE Trans. on Info. Theory; prelim. version at ITCS 2021full version
Bounds for list-decoding and list-recovery of random linear codesVenkatesan Guruswami, Ray Li, Jonathan Mosheiff, Shashwat Silas, and Mary WoottersIEEE Trans. on Info. Theory; prelim. version at RANDOM 2020full version
LDPC Codes Achieve List Decoding CapacityJonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, and Mary WoottersFOCS 2020; invited to SICOMP special issuefull version
On List Recovery of High-Rate Tensor CodesSwastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, and Shashwat SilasIEEE Trans. on Info. Theory; prelim. version at RANDOM 2018.full version
Lossless dimension expanders via linearized polynomials and subspace designsVenkatesan Guruswami, Nicolas Resch, and Chaoping XingCombinatorica; prelim. version at CCC 2018.full version
On the List-Decodability of Random Linear Rank-Metric CodesVenkatesan Guruswami and Nicolas ReschISIT 2018full version

Unpublished Manuscripts

TitleAuthorsLinks
Interactive Coding with Small Memory and Improved RateDorsa Fathollahi, Bernhard Haeupler, Nicolas Resch, Mary Woottersfull version
Randomness-Efficient Constructions of Capacity-Achieving List-Decodable CodesJonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuanfull version
The Fiat-Shamir Transformation of (Γ1,...,Γµ)-Special-Sound Interactive ProofsThomas Attema, Serge Fehr, Michael Klooß, and Nicolas Reschfull version
Worst and Average Case Hardness of Decoding via Smoothing BoundsThomas Debris-Alazard and Nicolas Reschfull version
Tight Bounds on List-Decodable and List-Recoverable Zero-Rate CodesNicolas Resch, Chen Yuan, and Yihan Zhangfull version

Teaching

Links for courses I've taught since starting at the UvA.

CourseSemesterLinks
Modern Cryptography (5062MOCR6Y)Fall 2024, Period 1Canvas
Information Theory (5314INTH6Y)Fall 2023, Period 2Canvas
Introduction to Information Theory (5122ITSL6Y)Fall 2023, Period 2Canvas
Information Theory (5314INTH6Y)Fall 2022, Period 2Canvas
Introduction to Information Theory (5122ITSL6Y)Fall 2022, Period 2Canvas

Supervision

I've had the pleasure of supervising some very talented students.

NameTitleDegreeDateNotes
Emiel WiedijkWorst-case to Average-case Reductions in Code-Based CryptographyMScSpring 2024Cum Laude
Martijn BrehmTBDPhDSeptember 2023-Present 
Mark BebawyCryptographic Compilers for Linear Probabilistically Checkable ProofsMSc ThesisSpring 2023Cum Laude
Jelle SipkesCryptanalysis of Weak Pseudorandom FunctionsJoint Math/CS BSc ThesisSpring 2023 

News

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