Near-Optimal Conversion of Hardness into Pseudo-Randomness. - Russell Impagliazzo; Ronen Shaltiel; Avi Wigderson (FOCS, 1999)

Extracting Randomness via Repeated Condensing. - Omer Reingold; Ronen Shaltiel; Avi Wigderson (FOCS, 2000)

Extractors and pseudo-random generators with optimal seed length. - Russell Impagliazzo; Ronen Shaltiel; Avi Wigderson (STOC, 2000)

Towards Proving Strong Direct Product Theorems. - Ronen Shaltiel (CCC, 2001)

Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. - Ronen Shaltiel; Christopher Umans (FOCS, 2001)

Explicit constructions of pseudo-random generators and extractors (בניות מפורשות של יצרנים פסאודו-אקראיים ומזקקי אקראיות.). - Ronen Shaltiel (2001)

Streaming Computation of Combinatorial Objects. - Ziv Bar-Yossef; Luca Trevisan 001; Omer Reingold; Ronen Shaltiel (CCC, 2002)

Recent Developments in Explicit Constructions of Extractors. - Ronen Shaltiel (Bull. EATCS, 2002)

True Random Number Generators Secure in a Changing Environment. - Boaz Barak; Ronen Shaltiel; Eran Tromer (CHES, 2003)

Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. - Dan Gutfreund; Ronen Shaltiel; Amnon Ta-Shma (CCC, 2003)

Computational Analogues of Entropy. - Boaz Barak; Ronen Shaltiel; Avi Wigderson (RANDOM-APPROX, 2003)

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. - Dan Gutfreund; Ronen Shaltiel; Amnon Ta-Shma (Comput. Complex., 2003)

Non-interactive Timestamping in the Bounded Storage Model. - Tal Moran; Ronen Shaltiel; Amnon Ta-Shma (CRYPTO, 2004)

Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. - Ariel Gabizon; Ran Raz; Ronen Shaltiel (FOCS, 2004)

Constant-Round Oblivious Transfer in the Bounded Storage Model. - Yan Zong Ding; Danny Harnik; Alon Rosen; Ronen Shaltiel (TCC, 2004)

List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. - Cynthia Dwork; Ronen Shaltiel; Adam D. Smith 001; Luca Trevisan 001 (TCC, 2004)

Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions - Iftach Haitner; Ronen Shaltiel (Electron. Colloquium Comput. Complex., 2004)

If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. - Dan Gutfreund; Ronen Shaltiel; Amnon Ta-Shma (CCC, 2005)

Pseudorandomness for Approximate Counting and Sampling. - Ronen Shaltiel; Christopher Umans (CCC, 2005)

Reducing Complexity Assumptions for Statistically-Hiding Commitment. - Iftach Haitner; Omer Horvitz; Jonathan Katz; Chiu-Yuen Koo; Ruggero Morselli; Ronen Shaltiel (EUROCRYPT, 2005)

Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. - Boaz Barak; Guy Kindler; Ronen Shaltiel; Benny Sudakov; Avi Wigderson (STOC, 2005)

Simple extractors for all min-entropies and a new pseudorandom generator. - Ronen Shaltiel; Christopher Umans (J. ACM, 2005)

How to Get More Mileage from Randomness Extractors. - Ronen Shaltiel (CCC, 2006)

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. - Boaz Barak; Anup Rao 001; Ronen Shaltiel; Avi Wigderson (STOC, 2006)

Reducing The Seed Length In The Nisan-Wigderson Generator. - Russell Impagliazzo; Ronen Shaltiel; Avi Wigderson (Comb., 2006)

Low-end uniform hardness vs. randomness tradeoffs for AM. - Ronen Shaltiel; Christopher Umans (STOC, 2007)

Increasing the Output Length of Zero-Error Dispersers. - Ariel Gabizon; Ronen Shaltiel (APPROX-RANDOM, 2008)

Hardness amplification proofs require majority. - Ronen Shaltiel; Emanuele Viola (STOC, 2008)

Strong Parallel Repetition Theorem for Free Projection Games. - Boaz Barak; Anup Rao 001; Ran Raz; Ricky Rosen; Ronen Shaltiel (APPROX-RANDOM, 2009)

Pseudorandom Generators and Typically-Correct Derandomization. - Jeff Kinne; Dieter van Melkebeek; Ronen Shaltiel (APPROX-RANDOM, 2009)

Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma. - Ronen Shaltiel (CCC, 2009)

On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. - Iftach Haitner; Alon Rosen; Ronen Shaltiel (TCC, 2009)

Low-End Uniform Hardness versus Randomness Tradeoffs for AM. - Ronen Shaltiel; Christopher Umans (SIAM J. Comput., 2009)

Derandomized Parallel Repetition Theorems for Free Games. - Ronen Shaltiel (CCC, 2010)

Typically-correct derandomization. - Ronen Shaltiel (SIGACT News, 2010)

Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification. - Sergei Artemenko; Ronen Shaltiel (APPROX-RANDOM, 2011)

Dispersers for Affine Sources with Sub-polynomial Entropy. - Ronen Shaltiel (FOCS, 2011)

An Introduction to Randomness Extractors. - Ronen Shaltiel (ICALP (2), 2011)

Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors. - Ariel Gabizon; Ronen Shaltiel (APPROX-RANDOM, 2012)

On beating the hybrid argument. - Bill Fefferman; Ronen Shaltiel; Christopher Umans; Emanuele Viola (ITCS, 2012)

Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds. - Jeff Kinne; Dieter van Melkebeek; Ronen Shaltiel (Comput. Complex., 2012)

Mining Circuit Lower Bound Proofs for Meta-algorithms. - Ruiwen Chen; Valentine Kabanets; Antonina Kolokolova; Ronen Shaltiel; David Zuckerman (CCC, 2014)

Pseudorandom generators with optimal seed length for non-boolean poly-size circuits. - Sergei Artemenko; Ronen Shaltiel (STOC, 2014)

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract). - Benny Applebaum; Sergei Artemenko; Ronen Shaltiel; Guang Yang 020 (CCC, 2015)

Parallel Hashing via List Recoverability. - Iftach Haitner; Yuval Ishai; Eran Omri; Ronen Shaltiel (CRYPTO (2), 2015)

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions. - Benny Applebaum; Sergei Artemenko; Ronen Shaltiel; Guang Yang 020 (Electron. Colloquium Comput. Complex., 2015)

Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. - Ronen Shaltiel; Jad Silbak (APPROX-RANDOM, 2016)

Pseudorandomness When the Odds are Against You. - Sergei Artemenko; Russell Impagliazzo; Valentine Kabanets; Ronen Shaltiel (CCC, 2016)

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions. - Benny Applebaum; Sergei Artemenko; Ronen Shaltiel; Guang Yang 020 (Comput. Complex., 2016)

Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs. - Aryeh Grinberg; Ronen Shaltiel; Emanuele Viola (FOCS, 2018)

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. - Iftach Haitner; Kobbi Nissim; Eran Omri; Ronen Shaltiel; Jad Silbak (FOCS, 2018)

Computational Two-Party Correlation. - Iftach Haitner; Kobbi Nissim; Eran Omri; Ronen Shaltiel; Jad Silbak (Electron. Colloquium Comput. Complex., 2018)

Quasilinear Time List-Decodable Codes for Space Bounded Channels. - Jad Silbak; Swastik Kopparty; Ronen Shaltiel (FOCS, 2019)

Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. - Iftach Haitner; Noam Mazor; Ronen Shaltiel; Jad Silbak (TCC (1), 2019)

Special Issue: APPROX-RANDOM 2016: Guest Editors' Foreword. - Shiri Chechik; Ronen Shaltiel (Theory Comput., 2019)

Is It Possible to Improve Yao's XOR Lemma Using Reductions That Exploit the Efficiency of Their Oracle? - Ronen Shaltiel (APPROX-RANDOM, 2020)

Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists). - Noga Ron-Zewi; Ronen Shaltiel; Nithin Varma 001 (ITCS, 2021)

Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity. - Ronen Shaltiel; Jad Silbak (STOC, 2021)

Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits. - Ronen Shaltiel; Jad Silbak (FOCS, 2022)

On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. - Ronen Shaltiel; Emanuele Viola (ITCS, 2022)

Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371). - Markus Bläser; Valentine Kabanets; Ronen Shaltiel; Jacobo Torán (Dagstuhl Reports, 2022)

Non-malleable Codes with Optimal Rate for Poly-Size Circuits. - Marshall Ball; Ronen Shaltiel; Jad Silbak (EUROCRYPT (4), 2024)

Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions. - Ronen Shaltiel; Jad Silbak (STOC, 2024)

Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 24381). - Markus Bläser; Shubhangi Saraf; Ronen Shaltiel; Jacobo Torán; Kilian Rothmund (Dagstuhl Reports, 2024)

Multiplicative Extractors for Samplable Distributions. - Ronen Shaltiel (CCC, 2025)

Extractors for Samplable Distributions with Low Min-Entropy. - Marshall Ball; Ronen Shaltiel; Jad Silbak (STOC, 2025)

Extractors for Samplable Distributions from the Two-Source Extractor Recipe. - Justin Oh; Ronen Shaltiel (Electron. Colloquium Comput. Complex., 2025)

Extractors for Samplable Distribution with Polynomially Small Min-Entropy. - Ronen Shaltiel (Electron. Colloquium Comput. Complex., 2025)