default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJad Silbak
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Marshall Ball
, Ronen Shaltiel, Jad Silbak:
Non-malleable Codes with Optimal Rate for Poly-Size Circuits. EUROCRYPT (4) 2024: 33-54- [c9]Ronen Shaltiel, Jad Silbak:
Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions. STOC 2024: 2028-2038 - [i16]Jad Silbak, Daniel Wichs:
Detecting and Correcting Computationally Bounded Errors: A Simple Construction Under Minimal Assumptions. IACR Cryptol. ePrint Arch. 2024: 1461 (2024) - 2023
- [c8]Iftach Haitner, Noam Mazor, Jad Silbak:
Incompressiblity and Next-Block Pseudoentropy. ITCS 2023: 66:1-66:18 - [i15]Marshall Ball, Ronen Shaltiel, Jad Silbak:
Non-malleable codes with optimal rate for poly-size circuits. Electron. Colloquium Comput. Complex. TR23 (2023) - [i14]Ronen Shaltiel, Jad Silbak:
Explicit Codes for Poly-Size Circuits and Functions that are Hard to Sample on Low Entropy Distributions. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c7]Ronen Shaltiel, Jad Silbak:
Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits. FOCS 2022: 13-23 - [c6]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the complexity of two-party differential privacy. STOC 2022: 1392-1405 - [i13]Iftach Haitner, Noam Mazor, Jad Silbak:
Incompressiblity and Next-Block Pseudoentropy. Electron. Colloquium Comput. Complex. TR22 (2022) - [i12]Ronen Shaltiel, Jad Silbak:
Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - [i11]Iftach Haitner, Noam Mazor, Jad Silbak:
Incompressiblity and Next-Block Pseudoentropy. IACR Cryptol. ePrint Arch. 2022: 278 (2022) - 2021
- [j2]Ronen Shaltiel, Jad Silbak:
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. Comput. Complex. 30(1): 3 (2021) - [c5]Ronen Shaltiel, Jad Silbak:
Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity. STOC 2021: 1516-1526 - [i10]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. CoRR abs/2105.00765 (2021) - [i9]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. CoRR abs/2105.00770 (2021) - [i8]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the Complexity of Two-Party Differential Privacy. CoRR abs/2108.07664 (2021) - [i7]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the Complexity of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j1]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. SIAM J. Comput. 49(6): 1041-1082 (2020) - [i6]Ronen Shaltiel, Jad Silbak:
Explicit Uniquely Decodable Codes for Space Bounded Channels That Achieve List-Decoding Capacity. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c4]Jad Silbak, Swastik Kopparty, Ronen Shaltiel:
Quasilinear Time List-Decodable Codes for Space Bounded Channels. FOCS 2019: 302-333 - [c3]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. TCC (1) 2019: 531-560 - [i5]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. Electron. Colloquium Comput. Complex. TR19 (2019) - [i4]Ronen Shaltiel, Swastik Kopparty, Jad Silbak:
Quasilinear time list-decodable codes for space bounded channels. Electron. Colloquium Comput. Complex. TR19 (2019) - [i3]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. IACR Cryptol. ePrint Arch. 2019: 616 (2019) - 2018
- [c2]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. FOCS 2018: 136-147 - [i2]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation. Electron. Colloquium Comput. Complex. TR18 (2018) - 2016
- [c1]Ronen Shaltiel, Jad Silbak:
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. APPROX-RANDOM 2016: 45:1-45:38 - [i1]Ronen Shaltiel, Jad Silbak:
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. Electron. Colloquium Comput. Complex. TR16 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 01:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
