| Explicit list-decodable codes with optimal rate for computationally bounded channels R Shaltiel, J Silbak computational complexity 30, 1-70, 2021 | 29 | 2021 |
| 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 | 18 | 2020 |
| 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 | 12 | 2022 |
| 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 | 12 | 2021 |
| Quasilinear time list-decodable codes for space bounded channels S Kopparty, R Shaltiel, J Silbak 60th Annual Symposium on Foundations of Computer Science (FOCS) 5, 2019 | 12* | 2019 |
| 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 | 11 | 2019 |
| 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 | 8 | 2022 |
| 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 | 7 | 2024 |
| Incompressiblity and next-block pseudoentropy I Haitner, N Mazor, J Silbak Cryptology ePrint Archive, 2022 | 6 | 2022 |
| 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 | 4 | 2024 |
| Extractor for samplable distributions with low min-entropy M Ball, R Shaltiel, J Silbak | 1 | 2024 |
| Detecting and correcting computationally bounded errors: A simple construction under minimal assumptions J Silbak, D Wichs Cryptology ePrint Archive, 2024 | 1 | 2024 |
| Mildly Accurate Computationally Differentially Private Inner Product Protocols Imply Oblivious Transfer I Haitner, N Mazor, J Silbak, E Tsfadia, C Yan arXiv preprint arXiv:2502.15629, 2025 | | 2025 |
| Binary Codes for Error Detection and Correction in a Computationally Bounded World J Silbak, D Wichs Cryptology ePrint Archive, 2025 | | 2025 |
Ronen ShaltielProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
