Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. - Ronen Shaltiel; Jad Silbak (APPROX-RANDOM, 2016)

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. - Iftach Haitner; Kobbi Nissim; Eran Omri; Ronen Shaltiel; Jad Silbak (FOCS, 2018)

Computational Two-Party Correlation. - Iftach Haitner; Kobbi Nissim; Eran Omri; Ronen Shaltiel; Jad Silbak (Electron. Colloquium Comput. Complex., 2018)

Quasilinear Time List-Decodable Codes for Space Bounded Channels. - Jad Silbak; Swastik Kopparty; Ronen Shaltiel (FOCS, 2019)

Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. - Iftach Haitner; Noam Mazor; Ronen Shaltiel; Jad Silbak (TCC (1), 2019)

Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity. - Ronen Shaltiel; Jad Silbak (STOC, 2021)

Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits. - Ronen Shaltiel; Jad Silbak (FOCS, 2022)

On the complexity of two-party differential privacy. - Iftach Haitner; Noam Mazor; Jad Silbak; Eliad Tsfadia (STOC, 2022)

Incompressiblity and Next-Block Pseudoentropy. - Iftach Haitner; Noam Mazor; Jad Silbak (ITCS, 2023)

Non-malleable Codes with Optimal Rate for Poly-Size Circuits. - Marshall Ball; Ronen Shaltiel; Jad Silbak (EUROCRYPT (4), 2024)

Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions. - Ronen Shaltiel; Jad Silbak (STOC, 2024)

Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer. - Iftach Haitner; Noam Mazor; Jad Silbak; Eliad Tsfadia; Chao Yan (CRYPTO (4), 2025)

Binary Codes for Error Detection and Correction in a Computationally Bounded World. - Jad Silbak; Daniel Wichs (EUROCRYPT (1), 2025)

Detecting and Correcting Computationally Bounded Errors: A Simple Construction Under Minimal Assumptions. - Jad Silbak; Daniel Wichs (ITCS, 2025)

Extractors for Samplable Distributions with Low Min-Entropy. - Marshall Ball; Ronen Shaltiel; Jad Silbak (STOC, 2025)

Seedless Condensers for Efficiently Samplable Sources. - Cody Freitag; Jad Silbak; Daniel Wichs (IACR Cryptol. ePrint Arch., 2025)

Binary Codes for Computationally Bounded Errors Under Standard Crypto Assumptions. - George Lu; Jad Silbak; Daniel Wichs (IACR Cryptol. ePrint Arch., 2025)

Mildly Accurate Computationally Differentially Private Inner Product Protocols Imply Oblivious Transfer. - Iftach Haitner; Noam Mazor; Jad Silbak; Eliad Tsfadia; Chao Yan (CoRR, 2025)