Ronen Shaltiel

View Scopus Profile

Ronen Shaltiel

 https://orcid.org/0000-0002-5182-593X
    19992024

    Research activity per year

    Filter
    Conference contribution

    Search results

    • 2024

      Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions

      Shaltiel, R. & Silbak, J., 10 Jun 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). Association for Computing Machinery, p. 2028-2038 11 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Non-malleable Codes with Optimal Rate for Poly-Size Circuits

      Ball, M., Shaltiel, R. & Silbak, J., 2024, Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Joye, M. & Leander, G. (eds.). Springer Science and Business Media Deutschland GmbH, p. 33-54 22 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14654 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2022

      Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits

      Shaltiel, R. & Silbak, J., 2022, Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022. IEEE Computer Society, p. 13-23 11 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-October).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On Hardness Assumptions Needed for “Extreme High-End” PRGs and Fast Derandomization

      Shaltiel, R. & Viola, E., 1 Jan 2022, 13th Innovations in Theoretical Computer Science Conference, ITCS 2022. Braverman, M. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 116. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 215).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2021

      Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity

      Shaltiel, R. & Silbak, J., 15 Jun 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 1516-1526 11 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists)

      Shaltiel, R., Ron-Zewi, N. & Varma, N., 2021, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Lee, J. R. (ed.). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Vol. 185. p. 33:1-33:18 33. (Leibniz International Proceedings in Informatics (LIPIcs)).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2020

      Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle?

      Shaltiel, R., 1 Aug 2020, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020. Byrka, J. & Meka, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, APPROX10. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 176).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2019

      Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation

      Haitner, I., Mazor, N., Shaltiel, R. & Silbak, J., 2019, Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings. Hofheinz, D. & Rosen, A. (eds.). Springer, p. 531-560 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11891 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Quasilinear time list-decodable codes for space bounded channels

      Silbak, J., Kopparty, S. & Shaltiel, R., Nov 2019, Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019. IEEE Computer Society, p. 302-333 32 p. 8948670. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2019-November).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2018

      Computational two-party correlation: A dichotomy for key-agreement protocols

      Haitner, I., Nissim, K., Omri, E., Shaltiel, R. & Silbak, J., 30 Nov 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). IEEE Computer Society, p. 136-147 12 p. 8555100. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2018-October).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Indistinguishability by adaptive procedures with advice, and lower bounds on hardness amplification proofs

      Grinberg, A., Shaltiel, R. & Viola, E., 30 Nov 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). IEEE Computer Society, p. 956-966 11 p. 8555172. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2018-October).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2016

      Explicit list-decodable codes with optimal rate for computationally bounded channels

      Shaltiel, R. & Silbak, J., 1 Sep 2016, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016. Jansen, K., Mathieu, C., Rolim, J. D. P. & Umans, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 60).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Pseudorandomness when the odds are against you

      Artemenko, S., Impagliazzo, R., Kabanets, V. & Shaltiel, R., 1 May 2016, 31st Conference on Computational Complexity, CCC 2016. Raz, R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 9:1-9:35 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 50).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2015

      Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract)

      Applebaum, B., Artemenko, S., Shaltiel, R. & Yang, G., 1 Jun 2015, 30th Conference on Computational Complexity, CCC 2015. Zuckerman, D. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 582-600 19 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 33).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Parallel hashing via list recoverability

      Haitner, I., Ishai, Y., Omri, E. & Shaltiel, R., 2015, Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Proceedings. Robshaw, M. & Gennaro, R. (eds.). Springer Verlag, p. 173-190 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9216).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2014

      Mining circuit lower bound proofs for meta-algorithms

      Chen, R., Kabanets, V., Kolokolova, A., Shaltiel, R. & Zuckerman, D., 2014, Proceedings - IEEE 29th Conference on Computational Complexity, CCC 2014. IEEE Computer Society, p. 262-273 12 p. 6875495. (Proceedings of the Annual IEEE Conference on Computational Complexity).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Pseudorandom generators with optimal seed length for non-boolean poly-size circuits

      Artemenko, S. & Shaltiel, R., 2014, STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 99-108 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Randomness extractors and data storage

      Gabizon, A. & Shaltiel, R., 2014, 2014 IEEE 28th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2014. Institute of Electrical and Electronics Engineers Inc., 7005791. (2014 IEEE 28th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2014).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2012

      Invertible zero-error dispersers and defective memory with stuck-at errors

      Gabizon, A. & Shaltiel, R., 2012, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Proceedings. p. 553-564 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7408 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On beating the hybrid argument

      Fefferman, B., Shaltiel, R., Umans, C. & Viola, E., 2012, ITCS 2012 - Innovations in Theoretical Computer Science Conference. p. 468-483 16 p. (ITCS 2012 - Innovations in Theoretical Computer Science Conference).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2011

      An introduction to randomness extractors

      Shaltiel, R., 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 2 ed. p. 21-41 21 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6756 LNCS, no. PART 2).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Dispersers for affine sources with sub-polynomial entropy

      Shaltiel, R., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 247-256 10 p. 6108177. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification

      Artemenko, S. & Shaltiel, R., 2011, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Proceedings. p. 377-388 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6845 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2010

      Derandomized parallel repetition theorems for free games

      Shaltiel, R., 2010, Proceedings - 25th Annual IEEE Conference on Computational Complexity, CCC 2010. p. 28-37 10 p. 5497902. (Proceedings of the Annual IEEE Conference on Computational Complexity).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2009

      On the (Im)possibility of arthur-merlin witness hiding protocols

      Haitner, I., Rosen, A. & Shaltiel, R., 2009, Theory of Cryptography - 6th Theory of Cryptography Conference, TCC 2009, Proceedings. p. 220-237 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5444 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Pseudorandom generators and typically-correct derandomization

      Kinne, J., Van Melkebeek, D. & Shaltiel, R., 2009, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Proceedings. p. 574-587 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5687 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Strong parallel repetition theorem for free projection games

      Barak, B., Rao, A., Raz, R., Rosen, R. & Shaltiel, R., 2009, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Proceedings. p. 352-365 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5687 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Weak derandomization of weak algorithms: Explicit versions of Yao's lemma

      Shaltiel, R., 2009, Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity, CCC 2009. p. 114-125 12 p. 5231257. (Proceedings of the Annual IEEE Conference on Computational Complexity).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2008

      Hardness amplification proofs require majority

      Shaltiel, R. & Viola, E., 2008, STOC'08: Proceedings of the 2008 ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), p. 589-598 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Increasing the output length of zero-error dispersers

      Gabizon, A. & Shaltiel, R., 2008, Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. p. 430-443 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5171 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2007

      Low-end uniform hardness vs. randomness tradeoffs for AM

      Shaltiel, R. & Umans, C., 2007, STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. p. 430-439 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2006

      2-Source dispersers for sub-polynomial entropy and ramsay graphs beating the frankl-wilson construction

      Barak, B., Rao, A., Shaltiel, R. & Wigderson, A., 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. p. 671-680 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 2006).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • How to get more mileage from randomness extractors

      Shaltiel, R., 2006, Proceedings - Twenty-First Annual IEEE Conference on Computational Complexity, CCC 2006. p. 46-60 15 p. 1663725. (Proceedings of the Annual IEEE Conference on Computational Complexity; vol. 2006).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2005

      If NP languages are hard on the worst-case then it is easy to find their hard instances

      Gutfreund, D., Shaltiel, R. & Ta-Shma, A., 2005, Proceedings of the 20th Annual IEEE Conference on Computational Complexity. p. 243-257 15 p. (Proceedings of the Annual IEEE Conference on Computational Complexity).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Pseudorandomness for approximate counting and sampling

      Shaltiel, R. & Umans, C., 2005, Proceedings of the 20th Annual IEEE Conference on Computational Complexity. p. 212-226 15 p. (Proceedings of the Annual IEEE Conference on Computational Complexity).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access