Jad Silbak

jadsilbak[at]mail.tau.ac.il

I am a postdoctoral researcher at the Department of Computer Science at Northeastern University. I am fortunate to be working with Daniel Wichs, and I am funded by the Khoury College Distinguished Postdoctoral Fellowship.

Previously I was a postdoctoral research fellow at the Simons Institute for the Theory of Computing at UC Berkeley for the summer crypto program of 2025. I also spent five months as a postdoctoral researcher at Tel Aviv University hosted by Benny Applebaum.

My main research interests are Cryptography, Complexity Theory and Derandomization.

I received my PhD at the School of Computer Science at Tel Aviv University. I am fortunate to have had Iftach Haitner and Ronen Shaltiel as my two advisors.

I received my B.Sc. and M.Sc. in Computer Science from the University of Haifa under the supervision of Ronen Shaltiel.

Program Committee

CSCML 2025 - The International Symposium on Cyber Security, Cryptology and Machine Learning (CSCML).
Crypto 2025 - International Cryptology Conference (Crypto).
RANDOM 2023 - International Conference on Randomization and Computation (RANDOM)

Publications

Seedless Condensers for Efficiently Samplable Sources.
- Cody Freitag , Jad Silbak, Daniel Wichs.
- TCC 2025.

Binary Codes for Computationally Bounded Errors Under Standard Crypto Assumptions.
- George Lu, Jad Silbak, Daniel Wichs.
- FOCS 2025.

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

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

Binary Codes for Error Detection and Correction in a Computationally Bounded World.
- Jad Silbak, Daniel Wichs.
- Eurocrypt 2025.

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

Explicit Codes for Poly-Size Circuits and Functions that are Hard to Sample on Low Entropy Distributions.
- Ronen Shaltiel, Jad Silbak.
- STOC 2024.

Non-malleable codes with optimal rate for poly-size circuits.
- Marshall Ball, Ronen Shaltiel, Jad Silbak.
- Eurocrypt 2024.

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

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.

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

Quasilinear time list-decodable codes for space bounded channels.
- Swastik Kopparty, Ronen Shaltiel, Jad Silbak.
- 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 2019.

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

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

Teachings Assistant

Tel Aviv University:
- Algorithms: Winter 2019, Spring 2019, Winter 2020, Spring 2020, Winter 2021, Spring 2021, Winter 2022.
University of Haifa:
- Computational Models: Spring 2015, Winter 2016, Spring 2016, Winter 2017, Spring 2017.

CV

Attached is a CV.

Page updated

Google Sites

Report abuse