Nicolas Resch

According to our database, Nicolas Resch authored at least 22 papers between 2018 and 2024.

Collaborative distances:

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

2024

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

Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan

CoRR, 2024

2023

Smoothing Codes and Lattices: Systematic Study and New Bounds.

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

IEEE Trans. Inf. Theory, September, 2023

Oblivious Transfer with Constant Computational Overhead.

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

IACR Cryptol. ePrint Arch., 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

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

Nicolas Resch, Chen Yuan, Yihan Zhang

CoRR, 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

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

2022

Threshold Rates for Properties of Random Codes.

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

IEEE Trans. Inf. Theory, 2022

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

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

IEEE Trans. Inf. Theory, 2022

Worst and Average Case Hardness of Decoding via Smoothing Bounds.

Thomas Debris-Alazard, Nicolas Resch

IACR Cryptol. ePrint Arch., 2022

Correlated Pseudorandomness from Expand-Accumulate Codes.

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

IACR Cryptol. ePrint Arch., 2022

Interactive Coding with Small Memory.

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

Electron. Colloquium Comput. Complex., 2022

Circuits Resilient to Short-Circuit Errors.

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

Electron. Colloquium Comput. Complex., 2022

Threshold Rates of Codes Ensembles: Linear is Best.

Nicolas Resch, Chen Yuan

CoRR, 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

2021

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

Nicolas Resch, Chen Yuan

IACR Cryptol. ePrint Arch., 2021

Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs.

Venkatesan Guruswami, Nicolas Resch, Chaoping Xing

Comb., 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

2019

LDPC Codes Achieve List-Decoding Capacity.

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

Electron. Colloquium Comput. Complex., 2019

On List Recovery of High-Rate Tensor Codes.

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

Electron. Colloquium Comput. Complex., 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