Jad Silbak
jadsilbak[at]mail.tau.ac.il
I am very fortunate to be a postdoctoral researcher at the Department of Computer Science at Northeastern University, I am working with Daniel Wichs and Emanuele Viola, and I am funded by the Khoury College Distinguished Postdoctoral Fellowship.
Prior to this, I 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.
Publications
Ronen Shaltiel, Jad Silbak.
Accepted to STOC 2024.
Non-malleable codes with optimal rate for poly-size circuits.
Marshall Ball, Ronen Shaltiel, Jad Silbak.
Accepted to Eurocrypt 2024.
Incompressiblity and Next-Block Pseudoentropy.
Iftach Haitner, Noam Mazor, Jad Silbak.
In Proceedings of the 14th Innovations in Theoretical Computer Science Conference, (ITCS), 2023.
Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits.
Ronen Shaltiel, Jad Silbak.
In Proceedings of the 63th Annual IEEE Symposium on Foundations of Computer Science, (FOCS), 2022.
On the Complexity of Two-Party Differential Privacy.
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia.
In Proceedings of the 54rd Annual ACM Symposium on the Theory of Computing, (STOC), 2022.
Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity.
Ronen Shaltiel, Jad Silbak.
In Proceedings of the 53rd Annual ACM Symposium on the Theory of Computing, (STOC), 2021.
Quasilinear time list-decodable codes for space bounded channels.
Swastik Kopparty, Ronen Shaltiel, Jad Silbak.
In Proceedings of the 60th Annual IEEE Symposium on Foundations of Computer Science, (FOCS), 2019.
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak.
In Proceedings of the 17th Theory of Cryptography Conference, (TCC), 2019.
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak.
In Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science, (FOCS), 2018.
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels.
Ronen Shaltiel, Jad Silbak.
In Proceedings of the 16th International Workshop on Randomization and Approximation Techniques in Computer Science, (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.