Jad Silbak

According to our database, Jad Silbak authored at least 18 papers between 2016 and 2025.

Collaborative distances:

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

2025

Mildly Accurate Computationally Differentially Private Inner Product Protocols Imply Oblivious Transfer.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan

CoRR, February, 2025

Binary Codes for Computationally Bounded Errors Under Standard Crypto Assumptions.

George Lu, Jad Silbak, Daniel Wichs

IACR Cryptol. ePrint Arch., 2025

Seedless Condensers for Efficiently Samplable Sources.

Cody Freitag, Jad Silbak, Daniel Wichs

IACR Cryptol. ePrint Arch., 2025

Extractors for Samplable Distributions with Low Min-Entropy.

Marshall Ball, Ronen Shaltiel, Jad Silbak

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Detecting and Correcting Computationally Bounded Errors: A Simple Construction Under Minimal Assumptions.

Jad Silbak, Daniel Wichs

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Binary Codes for Error Detection and Correction in a Computationally Bounded World.

Jad Silbak, Daniel Wichs

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024

Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions.

Ronen Shaltiel, Jad Silbak

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Non-malleable Codes with Optimal Rate for Poly-Size Circuits.

Marshall Ball, Ronen Shaltiel, Jad Silbak

Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023

Incompressiblity and Next-Block Pseudoentropy.

Iftach Haitner, Noam Mazor, Jad Silbak

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

On the complexity of two-party differential privacy.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits.

Ronen Shaltiel, Jad Silbak

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity.

Ronen Shaltiel, Jad Silbak

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2019

Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.

Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Quasilinear Time List-Decodable Codes for Space Bounded Channels.

Jad Silbak, Swastik Kopparty, Ronen Shaltiel

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Computational Two-Party Correlation.

Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2018

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.

Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2016

Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels.

Ronen Shaltiel, Jad Silbak

Proceedings of the Approximation, 2016