Ronen Shaltiel

126 papers A* 21A 16B 3Journal 72Unranked 12
YearRankTypeTitle / Venue / Authors
2026 J jnl
Multiplicative Pseudorandom Generators for Nondeterministic Circuits.
Electron. Colloquium Comput. Complex.
Alon Dermer, Ronen Shaltiel
2025 J jnl
Extractors for Samplable Distribution with Polynomially Small Min-Entropy.
Electron. Colloquium Comput. Complex.
Ronen Shaltiel
2025 J jnl
Extractors for Samplable Distributions from the Two-Source Extractor Recipe.
Electron. Colloquium Comput. Complex.
Justin Oh, Ronen Shaltiel
2025 A* conf
Extractors for Samplable Distributions with Low Min-Entropy.
STOC
Marshall Ball, Ronen Shaltiel, Jad Silbak
2025 A* conf
Extractors for Samplable Distributions with Polynomially Small Min-Entropy.
FOCS
Ronen Shaltiel
2025 A conf
Multiplicative Extractors for Samplable Distributions.
CCC
Ronen Shaltiel
2024 J jnl
Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 24381).
Dagstuhl Reports
Markus Bläser, Shubhangi Saraf, Ronen Shaltiel, Jacobo Torán, Kilian Rothmund
2024 A* conf
Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions.
STOC
Ronen Shaltiel, Jad Silbak
2024 J jnl
Extractors for Samplable Distributions with Low Min-Entropy.
Electron. Colloquium Comput. Complex.
Marshall Ball, Ronen Shaltiel, Jad Silbak
2024 J jnl
Multiplicative Extractors for Samplable Distributions.
Electron. Colloquium Comput. Complex.
Ronen Shaltiel
2024 — conf
Non-malleable Codes with Optimal Rate for Poly-Size Circuits.
EUROCRYPT (4)
Marshall Ball, Ronen Shaltiel, Jad Silbak
2024 J jnl
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists).
CoRR
Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma
2023 J jnl
Explicit Codes for Poly-Size Circuits and Functions that are Hard to Sample on Low Entropy Distributions.
Electron. Colloquium Comput. Complex.
Ronen Shaltiel, Jad Silbak
2023 J jnl
Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle?
Comput. Complex.
Ronen Shaltiel
2023 J jnl
Non-malleable codes with optimal rate for poly-size circuits.
Electron. Colloquium Comput. Complex.
Marshall Ball, Ronen Shaltiel, Jad Silbak
2023 J jnl
On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization.
CoRR
Ronen Shaltiel, Emanuele Viola
2022 J jnl
Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371).
Dagstuhl Reports
Markus Bläser, Valentine Kabanets, Ronen Shaltiel, Jacobo Torán
2022 A* conf
Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits.
FOCS
Ronen Shaltiel, Jad Silbak
2022 J jnl
Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits.
Electron. Colloquium Comput. Complex.
Ronen Shaltiel, Jad Silbak
2022 A conf
On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization.
ITCS
Ronen Shaltiel, Emanuele Viola
2021 J jnl
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.
CoRR
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
2021 J jnl
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.
CoRR
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
2021 J jnl
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels.
Comput. Complex.
Ronen Shaltiel, Jad Silbak
2021 A* conf
Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity.
STOC
Ronen Shaltiel, Jad Silbak
2021 J jnl
On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization.
Electron. Colloquium Comput. Complex.
Ronen Shaltiel, Emanuele Viola
2021 A conf
Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists).
ITCS
Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma
2020 J jnl
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.
SIAM J. Comput.
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
2020 J jnl
Explicit Uniquely Decodable Codes for Space Bounded Channels That Achieve List-Decoding Capacity.
Electron. Colloquium Comput. Complex.
Ronen Shaltiel, Jad Silbak
2020 — conf
Is It Possible to Improve Yao's XOR Lemma Using Reductions That Exploit the Efficiency of Their Oracle?
APPROX-RANDOM
Ronen Shaltiel
2020 J jnl
Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle?
Electron. Colloquium Comput. Complex.
Ronen Shaltiel
2020 J jnl
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists).
Electron. Colloquium Comput. Complex.
Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma
2019 — conf
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.
TCC (1)
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
2019 J jnl
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
2019 J jnl
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
2019 A* conf
Quasilinear Time List-Decodable Codes for Space Bounded Channels.
FOCS
Jad Silbak, Swastik Kopparty, Ronen Shaltiel
2019 J jnl
Quasilinear time list-decodable codes for space bounded channels.
Electron. Colloquium Comput. Complex.
Ronen Shaltiel, Swastik Kopparty, Jad Silbak
2019 J jnl
Special Issue: APPROX-RANDOM 2016: Guest Editors' Foreword.
Theory Comput.
Shiri Chechik, Ronen Shaltiel
2018 J jnl
Computational Two-Party Correlation.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
2018 A* conf
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.
FOCS
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
2018 A* conf
Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs.
FOCS
Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola
2018 J jnl
Indistinguishability by adaptive procedures with advice, and lower bounds on hardness amplification proofs.
Electron. Colloquium Comput. Complex.
Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola
2017 J jnl
Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits.
ACM Trans. Comput. Theory
Sergei Artemenko, Ronen Shaltiel
2016 — conf
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels.
APPROX-RANDOM
Ronen Shaltiel, Jad Silbak
2016 J jnl
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels.
Electron. Colloquium Comput. Complex.
Ronen Shaltiel, Jad Silbak
2016 J jnl
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions.
Comput. Complex.
Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang
2016 A conf
Pseudorandomness When the Odds are Against You.
CCC
Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel
2016 J jnl
Pseudorandomness when the odds are against you.
Electron. Colloquium Comput. Complex.
Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel
2015 A conf
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract).
CCC
Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang
2015 J jnl
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang
2015 J jnl
Mining Circuit Lower Bound Proofs for Meta-Algorithms.
Comput. Complex.
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
2015 — conf
Parallel Hashing via List Recoverability.
CRYPTO (2)
Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel
2014 J jnl
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification.
Comput. Complex.
Sergei Artemenko, Ronen Shaltiel
2014 A conf
Mining Circuit Lower Bound Proofs for Meta-algorithms.
CCC
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
2014 A* conf
Pseudorandom generators with optimal seed length for non-boolean poly-size circuits.
STOC
Sergei Artemenko, Ronen Shaltiel
2013 J jnl
Derandomized Parallel Repetition Theorems for Free Games.
Comput. Complex.
Ronen Shaltiel
2013 J jnl
Mining Circuit Lower Bound Proofs for Meta-Algorithms.
Electron. Colloquium Comput. Complex.
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
2013 J jnl
On Beating the Hybrid Argument.
Theory Comput.
Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola
2012 J jnl
Increasing the output length of zero-error dispersers.
Random Struct. Algorithms
Ariel Gabizon, Ronen Shaltiel
2012 — conf
Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors.
APPROX-RANDOM
Ariel Gabizon, Ronen Shaltiel
2012 A conf
On beating the hybrid argument.
ITCS
Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola
2012 J jnl
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds.
Comput. Complex.
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
2011 — conf
An Introduction to Randomness Extractors.
ICALP (2)
Ronen Shaltiel
2011 A* conf
Dispersers for Affine Sources with Sub-polynomial Entropy.
FOCS
Ronen Shaltiel
2011 J jnl
Dispersers for affine sources with sub-polynomial entropy.
Electron. Colloquium Comput. Complex.
Ronen Shaltiel
2011 — conf
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification.
APPROX-RANDOM
Sergei Artemenko, Ronen Shaltiel
2011 J jnl
Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification.
Electron. Colloquium Comput. Complex.
Sergei Artemenko, Ronen Shaltiel
2011 J jnl
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma.
Comput. Complex.
Ronen Shaltiel
2010 — ed.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings
APPROX-RANDOM
Maria J. Serna, Ronen Shaltiel, Klaus Jansen, José D. P. Rolim
2010 A conf
Derandomized Parallel Repetition Theorems for Free Games.
CCC
Ronen Shaltiel
2010 J jnl
Hardness Amplification Proofs Require Majority.
SIAM J. Comput.
Ronen Shaltiel, Emanuele Viola
2010 J jnl
On beating the hybrid argument.
Electron. Colloquium Comput. Complex.
Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola
2010 J jnl
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds.
Electron. Colloquium Comput. Complex.
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
2010 J jnl
Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors.
Electron. Colloquium Comput. Complex.
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
2010 J jnl
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors.
J. ACM
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
2010 J jnl
Typically-correct derandomization.
SIGACT News
Ronen Shaltiel
2009 J jnl
Low-End Uniform Hardness versus Randomness Tradeoffs for AM.
SIAM J. Comput.
Ronen Shaltiel, Christopher Umans
2009 J jnl
Non-interactive Timestamping in the Bounded-Storage Model.
J. Cryptol.
Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
2009 B conf
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.
TCC
Iftach Haitner, Alon Rosen, Ronen Shaltiel
2009 — conf
Pseudorandom Generators and Typically-Correct Derandomization.
APPROX-RANDOM
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
2009 J jnl
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
J. Cryptol.
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel
2009 — conf
Strong Parallel Repetition Theorem for Free Projection Games.
APPROX-RANDOM
Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel
2009 A conf
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma.
CCC
Ronen Shaltiel
2008 A* conf
Hardness amplification proofs require majority.
STOC
Ronen Shaltiel, Emanuele Viola
2008 J jnl
How to get more mileage from randomness extractors.
Random Struct. Algorithms
Ronen Shaltiel
2008 — conf
Increasing the Output Length of Zero-Error Dispersers.
APPROX-RANDOM
Ariel Gabizon, Ronen Shaltiel
2007 J jnl
Constant-Round Oblivious Transfer in the Bounded Storage Model.
J. Cryptol.
Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel
2007 J jnl
Hardness amplification proofs require majority.
Electron. Colloquium Comput. Complex.
Ronen Shaltiel, Emanuele Viola
2007 J jnl
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances.
Comput. Complex.
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
2007 A* conf
Low-end uniform hardness vs. randomness tradeoffs for AM.
STOC
Ronen Shaltiel, Christopher Umans
2007 J jnl
Low-end uniform hardness vs. randomness tradeoffs for AM.
Electron. Colloquium Comput. Complex.
Ronen Shaltiel, Christopher Umans
2006 A* conf
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction.
STOC
Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson
2006 J jnl
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed.
SIAM J. Comput.
Ariel Gabizon, Ran Raz, Ronen Shaltiel
2006 J jnl
Extracting Randomness via Repeated Condensing.
SIAM J. Comput.
Omer Reingold, Ronen Shaltiel, Avi Wigderson
2006 A conf
How to Get More Mileage from Randomness Extractors.
CCC
Ronen Shaltiel
2006 J jnl
Pseudorandomness for Approximate Counting and Sampling.
Comput. Complex.
Ronen Shaltiel, Christopher Umans
2006 J jnl
Reducing The Seed Length In The Nisan-Wigderson Generator.
Comb.
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
2005 J jnl
Deterministic Extractors for Bit-fixing Sources by Obtaining an Independent Seed
Electron. Colloquium Comput. Complex.
Ariel Gabizon, Ran Raz, Ronen Shaltiel
2005 J jnl
How to get more mileage from randomness extractors
Electron. Colloquium Comput. Complex.
Ronen Shaltiel
2005 A conf
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances.
CCC
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
2005 A conf
Pseudorandomness for Approximate Counting and Sampling.
CCC
Ronen Shaltiel, Christopher Umans
2005 A* conf
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
EUROCRYPT
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel
2005 J jnl
Simple extractors for all min-entropies and a new pseudorandom generator.
J. ACM
Ronen Shaltiel, Christopher Umans
2005 A* conf
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors.
STOC
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
2004 B conf
Constant-Round Oblivious Transfer in the Bounded Storage Model.
TCC
Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel
2004 A* conf
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed.
FOCS
Ariel Gabizon, Ran Raz, Ronen Shaltiel
2004 B conf
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument.
TCC
Cynthia Dwork, Ronen Shaltiel, Adam D. Smith, Luca Trevisan
2004 A* conf
Non-interactive Timestamping in the Bounded Storage Model.
CRYPTO
Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
2004 J jnl
Pseudorandomness for Approximate Counting and Sampling
Electron. Colloquium Comput. Complex.
Ronen Shaltiel, Christopher Umans
2004 J jnl
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions
Electron. Colloquium Comput. Complex.
Iftach Haitner, Ronen Shaltiel
2004 J jnl
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Ronen Shaltiel
2003 — conf
Computational Analogues of Entropy.
RANDOM-APPROX
Boaz Barak, Ronen Shaltiel, Avi Wigderson
2003 J jnl
Towards proving strong direct product theorems.
Comput. Complex.
Ronen Shaltiel
2003 A conf
True Random Number Generators Secure in a Changing Environment.
CHES
Boaz Barak, Ronen Shaltiel, Eran Tromer
2003 J jnl
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games.
Comput. Complex.
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
2003 A conf
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games.
CCC
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
2002 J jnl
Recent Developments in Explicit Constructions of Extractors.
Bull. EATCS
Ronen Shaltiel
2002 A conf
Streaming Computation of Combinatorial Objects.
CCC
Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel
2001 — —
Explicit constructions of pseudo-random generators and extractors (בניות מפורשות של יצרנים פסאודו-אקראיים ומזקקי אקראיות.).
Ronen Shaltiel
2001 A* conf
Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator.
FOCS
Ronen Shaltiel, Christopher Umans
2001 A conf
Towards Proving Strong Direct Product Theorems.
CCC
Ronen Shaltiel
2001 J jnl
Towards proving strong direct product theorems
Electron. Colloquium Comput. Complex.
Ronen Shaltiel
2000 J jnl
Extracting Randomness via Repeated Condensing
Electron. Colloquium Comput. Complex.
Omer Reingold, Ronen Shaltiel, Avi Wigderson
2000 A* conf
Extracting Randomness via Repeated Condensing.
FOCS
Omer Reingold, Ronen Shaltiel, Avi Wigderson
2000 J jnl
Extractors and pseudo-random generators with optimal seed length
Electron. Colloquium Comput. Complex.
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
2000 A* conf
Extractors and pseudo-random generators with optimal seed length.
STOC
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
1999 A* conf
Near-Optimal Conversion of Hardness into Pseudo-Randomness.
FOCS
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson