( en | de | ru )

 

Disambiguation of "Silbak, Jad"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Two-Party Differential Privacy.

, , , and . Electron. Colloquium Comput. Complex., (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jad Hachem

Jad Nassar

Adam Jadczak

Amir Jadidi

Susanne Jäde

 

Other publications of authors with the same name

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols., , , , and . SIAM J. Comput., 49 (6): 1041-1082 (2020)Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits., and . FOCS, page 13-23. IEEE, (2022)Computational Two-Party Correlation., , , , and . Electron. Colloquium Comput. Complex., (2018)Explicit Uniquely Decodable Codes for Space Bounded Channels That Achieve List-Decoding Capacity., and . Electron. Colloquium Comput. Complex., (2020)Incompressiblity and Next-Block Pseudoentropy., , and . ITCS, volume 251 of LIPIcs, page 66:1-66:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity., and . STOC, page 1516-1526. ACM, (2021)Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels., and . APPROX-RANDOM, volume 60 of LIPIcs, page 45:1-45:38. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols., , , , and . FOCS, page 136-147. IEEE Computer Society, (2018)On the Complexity of Two-Party Differential Privacy., , , and . CoRR, (2021)Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels., and . Comput. Complex., 30 (1): 3 (2021)