Ronen Shaltiel

According to our database, Ronen Shaltiel authored at least 65 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Multiplicative Extractors for Samplable Distributions.

Ronen Shaltiel

Electron. Colloquium Comput. Complex., 2024

Extractors for Samplable Distributions with Low Min-Entropy.

Marshall Ball, Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2024

2023

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

Ronen Shaltiel

Comput. Complex., June, 2023

Explicit Codes for Poly-Size Circuits and Functions that are Hard to Sample on Low Entropy Distributions.

Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2023

Non-malleable codes with optimal rate for poly-size circuits.

Marshall Ball, Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2023

2022

Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371).

Markus Bläser, Valentine Kabanets, Ronen Shaltiel, Jacobo Torán

Dagstuhl Reports, September, 2022

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

Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2022

2021

On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization.

Ronen Shaltiel, Emanuele Viola

Electron. Colloquium Comput. Complex., 2021

Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels.

Ronen Shaltiel, Jad Silbak

Comput. Complex., 2021

2020

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.

Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak

SIAM J. Comput., 2020

Explicit Uniquely Decodable Codes for Space Bounded Channels That Achieve List-Decoding Capacity.

Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 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

Electron. Colloquium Comput. Complex., 2020

2019

Special Issue: APPROX-RANDOM 2016: Guest Editors' Foreword.

Shiri Chechik, Ronen Shaltiel

Theory Comput., 2019

Quasilinear time list-decodable codes for space bounded channels.

Ronen Shaltiel, Swastik Kopparty, Jad Silbak

Electron. Colloquium Comput. Complex., 2019

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

Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2019

2018

Computational Two-Party Correlation.

Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2018

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

Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola

Electron. Colloquium Comput. Complex., 2018

2017

Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits.

Sergei Artemenko, Ronen Shaltiel

ACM Trans. Comput. Theory, 2017

2016

Pseudorandomness when the odds are against you.

Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel

Electron. Colloquium Comput. Complex., 2016

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions.

Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang

Comput. Complex., 2016

2015

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions.

Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang

Electron. Colloquium Comput. Complex., 2015

Mining Circuit Lower Bound Proofs for Meta-Algorithms.

Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman

Comput. Complex., 2015

Parallel Hashing via List Recoverability.

Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract).

Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang

Proceedings of the 30th Conference on Computational Complexity, 2015

2014

Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification.

Sergei Artemenko, Ronen Shaltiel

Comput. Complex., 2014

2013

Derandomized Parallel Repetition Theorems for Free Games.

Ronen Shaltiel

Comput. Complex., 2013

2012

Increasing the output length of zero-error dispersers.

Ariel Gabizon, Ronen Shaltiel

Random Struct. Algorithms, 2012

Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds.

Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel

Comput. Complex., 2012

Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors.

Ariel Gabizon, Ronen Shaltiel

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Dispersers for affine sources with sub-polynomial entropy.

Ronen Shaltiel

Electron. Colloquium Comput. Complex., 2011

Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma.

Ronen Shaltiel

Comput. Complex., 2011

An Introduction to Randomness Extractors.

Ronen Shaltiel

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Typically-correct derandomization.

Ronen Shaltiel

SIGACT News, 2010

Hardness Amplification Proofs Require Majority.

Ronen Shaltiel, Emanuele Viola

SIAM J. Comput., 2010

On beating the hybrid argument.

Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola

Electron. Colloquium Comput. Complex., 2010

Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors.

Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson

Electron. Colloquium Comput. Complex., 2010

2009

Low-End Uniform Hardness versus Randomness Tradeoffs for AM.

Ronen Shaltiel, Christopher Umans

SIAM J. Comput., 2009

Non-interactive Timestamping in the Bounded-Storage Model.

Tal Moran, Ronen Shaltiel, Amnon Ta-Shma

J. Cryptol., 2009

Reducing Complexity Assumptions for Statistically-Hiding Commitment.

Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel

J. Cryptol., 2009

On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.

Iftach Haitner, Alon Rosen, Ronen Shaltiel

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Pseudorandom Generators and Typically-Correct Derandomization.

Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel

Proceedings of the Approximation, 2009

Strong Parallel Repetition Theorem for Free Projection Games.

Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel

Proceedings of the Approximation, 2009

2007

Constant-Round Oblivious Transfer in the Bounded Storage Model.

Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel

J. Cryptol., 2007

Low-end uniform hardness vs. randomness tradeoffs for AM.

Ronen Shaltiel, Christopher Umans

Electron. Colloquium Comput. Complex., 2007

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

Comput. Complex., 2007

2006

Extracting Randomness via Repeated Condensing.

Omer Reingold, Ronen Shaltiel, Avi Wigderson

SIAM J. Comput., 2006

Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed.

Ariel Gabizon, Ran Raz, Ronen Shaltiel

SIAM J. Comput., 2006

Reducing The Seed Length In The Nisan-Wigderson Generator.

Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson

Comb., 2006

Pseudorandomness for Approximate Counting and Sampling.

Ronen Shaltiel, Christopher Umans

Comput. Complex., 2006

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction.

Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

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

Electron. Colloquium Comput. Complex., 2005

2004

Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions

Iftach Haitner, Ronen Shaltiel

Electron. Colloquium Comput. Complex., 2004

List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument.

Cynthia Dwork, Ronen Shaltiel, Adam D. Smith, Luca Trevisan

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

2003

Towards proving strong direct product theorems.

Ronen Shaltiel

Comput. Complex., 2003

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games.

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

Comput. Complex., 2003

Computational Analogues of Entropy.

Boaz Barak, Ronen Shaltiel, Avi Wigderson

Proceedings of the Approximation, 2003

Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games.

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

True Random Number Generators Secure in a Changing Environment.

Boaz Barak, Ronen Shaltiel, Eran Tromer

Proceedings of the Cryptographic Hardware and Embedded Systems, 2003

2002

Recent Developments in Explicit Constructions of Extractors.

Ronen Shaltiel

Bull. EATCS, 2002

Streaming Computation of Combinatorial Objects.

Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001

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

Ronen Shaltiel

PhD thesis, 2001

Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator.

Ronen Shaltiel, Christopher Umans

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Extractors and pseudo-random generators with optimal seed length

Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson

Electron. Colloquium Comput. Complex., 2000

1999

Near-Optimal Conversion of Hardness into Pseudo-Randomness.

Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999