Nicolas Resch

According to our database, Nicolas Resch authored at least 29 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

List Recoverable Codes: The Good, the Bad, and the Unknown (hopefully not Ugly).

Nicolas Resch, S. Venkitesh

CoRR, October, 2025

Linear time encodable binary code achieving GV bound with linear time encodable dual achieving GV bound.

Martijn Brehm, Nicolas Resch

CoRR, September, 2025

Worst and Average Case Hardness of Decoding via Smoothing Bounds.

Thomas Debris-Alazard, Nicolas Resch

Proceedings of the Public-Key Cryptography - PKC 2025, 2025

Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes.

Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan

Proceedings of the IEEE International Symposium on Information Theory, 2025

On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography.

Maxime Bombar, Nicolas Resch, Emiel Wiedijk

Proceedings of the IEEE International Symposium on Information Theory, 2025

Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes.

Nicolas Resch, Chen Yuan, Yihan Zhang

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Blaze: Fast SNARKs from Interleaved RAA Codes.

Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, Hadas Zeilberger

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

List-Recovery of Random Linear Codes over Small Fields.

Dean Doron, Jonathan Mosheiff, Nicolas Resch, João Ribeiro

Proceedings of the Approximation, 2025

2024

Low-Density Parity-Check Codes Achieve List-Decoding Capacity.

Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters

SIAM J. Comput., 2024

Interactive Coding with Small Memory and Improved Rate.

Dorsa Fathollahi, Bernhard Haeupler, Nicolas Resch, Mary Wootters

CoRR, 2024

2023

A Generalized Special-Soundness Notion and its Knowledge Extractors.

Thomas Attema, Serge Fehr, Nicolas Resch

IACR Cryptol. ePrint Arch., 2023

The Fiat-Shamir Transformation of (Γ_{1,đots,Γ_μ)}-Special-Sound Interactive Proofs.

Thomas Attema, Serge Fehr, Michael Klooß, Nicolas Resch

IACR Cryptol. ePrint Arch., 2023

Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness.

Thomas Attema, Serge Fehr, Nicolas Resch

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Interactive Coding with Small Memory.

Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.

Nicolas Resch, Chen Yuan, Yihan Zhang

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Oblivious Transfer with Constant Computational Overhead.

Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate.

Nicolas Resch, Chen Yuan

Proceedings of the 4th Conference on Information-Theoretic Cryptography, 2023

2022

Threshold Rates for Properties of Random Codes.

Venkatesan Guruswami, Jonathan Moshieff, Nicolas Resch, Shashwat Silas, Mary Wootters

IEEE Trans. Inf. Theory, 2022

Smoothing Codes and Lattices: Systematic Study and New Bounds.

Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich

IACR Cryptol. ePrint Arch., 2022

Threshold Rates of Codes Ensembles: Linear is Best.

Nicolas Resch, Chen Yuan

CoRR, 2022

Circuits resilient to short-circuit errors.

Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Threshold Rates of Code Ensembles: Linear Is Best.

Nicolas Resch, Chen Yuan

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Correlated Pseudorandomness from Expand-Accumulate Codes.

Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Sharp Threshold Rates for Random Codes.

Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

LDPC Codes Achieve List Decoding Capacity.

Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Bounds for List-Decoding and List-Recovery of Random Linear Codes.

Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters

Proceedings of the Approximation, 2020

2019

On List Recovery of High-Rate Tensor Codes.

Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas

Proceedings of the Approximation, 2019

2018

On the List-Decodability of Random Linear Rank-Metric Codes.

Venkatesan Guruswami, Nicolas Resch

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs.

Venkatesan Guruswami, Nicolas Resch, Chaoping Xing

Proceedings of the 33rd Computational Complexity Conference, 2018