Jad Silbak

According to our database, Jad Silbak authored at least 11 papers between 2018 and 2023.

Collaborative distances:

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

2023

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

Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2023

Non-malleable codes with optimal rate for poly-size circuits.

Marshall Ball, Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2023

2022

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

Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2022

Incompressiblity and Next-Block Pseudoentropy.

Iftach Haitner, Noam Mazor, Jad Silbak

Electron. Colloquium Comput. Complex., 2022

2021

On the Complexity of Two-Party Differential Privacy.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia

Electron. Colloquium Comput. Complex., 2021

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

Ronen Shaltiel, Jad Silbak

Comput. Complex., 2021

2020

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

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

SIAM J. Comput., 2020

Explicit Uniquely Decodable Codes for Space Bounded Channels That Achieve List-Decoding Capacity.

Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2020

2019

Quasilinear time list-decodable codes for space bounded channels.

Ronen Shaltiel, Swastik Kopparty, Jad Silbak

Electron. Colloquium Comput. Complex., 2019

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

Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2019

2018

Computational Two-Party Correlation.

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

Electron. Colloquium Comput. Complex., 2018