| Explicit list-decodable codes with optimal rate for computationally bounded channels R Shaltiel, J Silbak computational complexity 30, 1-70, 2021 | 22 | 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 | 16 | 2020 |
| 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 | 8 | 2019 |
| 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 | 8* | 2019 |
| 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 | 7 | 2021 |
| 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 | 5 | 2022 |
| Incompressiblity and next-block pseudoentropy I Haitner, N Mazor, J Silbak Cryptology ePrint Archive, 2022 | 5 | 2022 |
| 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 | 4 | 2022 |
| Non-malleable codes with optimal rate for poly-size circuits M Ball, R Shaltiel, J Silbak Electronic Colloquium on Computational Complexity (ECCC),(167), 2023 | 1 | 2023 |
| Explicit codes for poly-size circuits and functions that are hard to sample on low entropy distributions R Shaltiel, J Silbak Electronic Colloquium on Computational Complexity (ECCC) 149, 2023 | 1 | 2023 |
Ronen ShaltielProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
