| 2026 | CRYPTO | Achieving Shannon Capacity for Computationally Bounded Errors. | George Lu, Jad Silbak, Daniel Wichs |
| 2025 | CRYPTO | Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer. | Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan |
| 2025 | EuroCrypt | Binary Codes for Error Detection and Correction in a Computationally Bounded World. | Jad Silbak, Daniel Wichs |
| 2025 | FOCS | Binary Codes for Computationally Bounded Errors Under Standard Crypto Assumptions. | George Lu, Jad Silbak, Daniel Wichs |
| 2025 | STOC | Extractors for Samplable Distributions with Low Min-Entropy. | Marshall Ball, Ronen Shaltiel, Jad Silbak |
| 2025 | TCC | Seedless Condensers for Efficiently Samplable Sources. | Cody Freitag, Jad Silbak, Daniel Wichs |
| 2024 | EuroCrypt | Non-malleable Codes with Optimal Rate for Poly-Size Circuits. | Marshall Ball, Ronen Shaltiel, Jad Silbak |
| 2024 | STOC | Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions. | Ronen Shaltiel, Jad Silbak |
| 2022 | FOCS | Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits. | Ronen Shaltiel, Jad Silbak |
| 2022 | STOC | On the complexity of two-party differential privacy. | Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia |
| 2021 | STOC | Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity. | Ronen Shaltiel, Jad Silbak |
| 2019 | FOCS | Quasilinear Time List-Decodable Codes for Space Bounded Channels. | Jad Silbak, Swastik Kopparty, Ronen Shaltiel |
| 2019 | TCC | Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. | Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak |
| 2018 | FOCS | Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. | Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak |