Follow
Jad Silbak
Jad Silbak
Northeastern University
Verified email at mail.tau.ac.il - Homepage
Title
Cited by
Cited by
Year
Explicit list-decodable codes with optimal rate for computationally bounded channels
R Shaltiel, J Silbak
computational complexity 30, 1-70, 2021
272021
Computational two-party correlation: A dichotomy for key-agreement protocols
I Haitner, K Nissim, E Omri, R Shaltiel, J Silbak
SIAM Journal on Computing 49 (6), 1041-1082, 2020
172020
Quasilinear time list-decodable codes for space bounded channels
S Kopparty, R Shaltiel, J Silbak
60th Annual Symposium on Foundations of Computer Science (FOCS), 2019
12*2019
On the complexity of two-party differential privacy
I Haitner, N Mazor, J Silbak, E Tsfadia
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
112022
Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity
R Shaltiel, J Silbak
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
112021
Channels of small log-ratio leakage and characterization of two-party differentially private computation
I Haitner, N Mazor, R Shaltiel, J Silbak
Theory of Cryptography Conference, 531-560, 2019
102019
Error correcting codes that achieve BSC capacity against channels that are poly-size circuits
R Shaltiel, J Silbak
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 13-23, 2022
72022
Explicit codes for poly-size circuits and functions that are hard to sample on low entropy distributions
R Shaltiel, J Silbak
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2028-2038, 2024
62024
Incompressiblity and next-block pseudoentropy
I Haitner, N Mazor, J Silbak
Cryptology ePrint Archive, 2022
62022
Non-malleable codes with optimal rate for poly-size circuits
M Ball, R Shaltiel, J Silbak
Annual International Conference on the Theory and Applications of …, 2024
42024
Extractors for Samplable Distributions with Low Min-Entropy
M Ball, R Shaltiel, J Silbak
2024
Detecting and Correcting Computationally Bounded Errors: A Simple Construction Under Minimal Assumptions
J Silbak, D Wichs
Cryptology ePrint Archive, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–12