Ronen Shaltiel

Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman: Mining Circuit Lower Bound Proofs for Meta-Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 20: 57 (2013)

Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel: Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds. Computational Complexity 21(1): 3-61 (2012)

Ariel Gabizon, Ronen Shaltiel: Increasing the output length of zero-error dispersers. Random Struct. Algorithms 40(1): 74-104 (2012)

Ariel Gabizon, Ronen Shaltiel: Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors. APPROX-RANDOM 2012: 553-564

Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola: On beating the hybrid argument. ITCS 2012: 468-483

Ronen Shaltiel: Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma. Computational Complexity 20(1): 87-143 (2011)

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

Ronen Shaltiel: Dispersers for Affine Sources with Sub-polynomial Entropy. FOCS 2011: 247-256

Ronen Shaltiel: An Introduction to Randomness Extractors. ICALP (2) 2011: 21-41

Sergei Artemenko, Ronen Shaltiel: Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification. Electronic Colloquium on Computational Complexity (ECCC) 18: 16 (2011)

Ronen Shaltiel: Dispersers for affine sources with sub-polynomial entropy. Electronic Colloquium on Computational Complexity (ECCC) 18: 127 (2011)

Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson: Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. J. ACM 57(4) (2010)

Ronen Shaltiel, Emanuele Viola: Hardness Amplification Proofs Require Majority. SIAM J. Comput. 39(7): 3122-3154 (2010)

Ronen Shaltiel: Typically-correct derandomization. SIGACT News 41(2): 57-72 (2010)

Ronen Shaltiel: Derandomized Parallel Repetition Theorems for Free Games. IEEE Conference on Computational Complexity 2010: 28-37

Maria J. Serna, Ronen Shaltiel, Klaus Jansen, José D. P. Rolim (Eds.): 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. Lecture Notes in Computer Science 6302, Springer 2010, isbn 978-3-642-15368-6

Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson: Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. Electronic Colloquium on Computational Complexity (ECCC) 17: 37 (2010)

Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel: Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC) 17: 129 (2010)

Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola: On beating the hybrid argument. Electronic Colloquium on Computational Complexity (ECCC) 17: 186 (2010)

Tal Moran, Ronen Shaltiel, Amnon Ta-Shma: Non-interactive Timestamping in the Bounded-Storage Model. J. Cryptology 22(2): 189-226 (2009)

Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. J. Cryptology 22(3): 283-310 (2009)

Ronen Shaltiel, Christopher Umans: Low-End Uniform Hardness versus Randomness Tradeoffs for AM. SIAM J. Comput. 39(3): 1006-1037 (2009)

Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel: Strong Parallel Repetition Theorem for Free Projection Games. APPROX-RANDOM 2009: 352-365

Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel: Pseudorandom Generators and Typically-Correct Derandomization. APPROX-RANDOM 2009: 574-587

Ronen Shaltiel: Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma. IEEE Conference on Computational Complexity 2009: 114-125

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

Ronen Shaltiel: How to get more mileage from randomness extractors. Random Struct. Algorithms 33(2): 157-186 (2008)

Ariel Gabizon, Ronen Shaltiel: Increasing the Output Length of Zero-Error Dispersers. APPROX-RANDOM 2008: 430-443

Ronen Shaltiel, Emanuele Viola: Hardness amplification proofs require majority. STOC 2008: 589-598

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Computational Complexity 16(4): 412-441 (2007)

Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel: Constant-Round Oblivious Transfer in the Bounded Storage Model. J. Cryptology 20(2): 165-202 (2007)

Ronen Shaltiel, Christopher Umans: Low-end uniform hardness vs. randomness tradeoffs for AM. STOC 2007: 430-439

Ronen Shaltiel, Christopher Umans: Low-end uniform hardness vs. randomness tradeoffs for AM. Electronic Colloquium on Computational Complexity (ECCC) 14(069) (2007)

Ronen Shaltiel, Emanuele Viola: Hardness amplification proofs require majority. Electronic Colloquium on Computational Complexity (ECCC) 14(130) (2007)

Ronen Shaltiel, Christopher Umans: Pseudorandomness for Approximate Counting and Sampling. Computational Complexity 15(4): 298-341 (2006)

Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Reducing The Seed Length In The Nisan-Wigderson Generator. Combinatorica 26(6): 647-681 (2006)

Omer Reingold, Ronen Shaltiel, Avi Wigderson: Extracting Randomness via Repeated Condensing. SIAM J. Comput. 35(5): 1185-1209 (2006)

Ariel Gabizon, Ran Raz, Ronen Shaltiel: Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. SIAM J. Comput. 36(4): 1072-1094 (2006)

Ronen Shaltiel: How to Get More Mileage from Randomness Extractors. IEEE Conference on Computational Complexity 2006: 46-60

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

Ronen Shaltiel, Christopher Umans: Simple extractors for all min-entropies and a new pseudorandom generator. J. ACM 52(2): 172-216 (2005)

Ronen Shaltiel, Christopher Umans: Pseudorandomness for Approximate Counting and Sampling. IEEE Conference on Computational Complexity 2005: 212-226

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. IEEE Conference on Computational Complexity 2005: 243-257

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

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

Ariel Gabizon, Ran Raz, Ronen Shaltiel: Deterministic Extractors for Bit-fixing Sources by Obtaining an Independent Seed. Electronic Colloquium on Computational Complexity (ECCC)(109) (2005)

Ronen Shaltiel: How to get more mileage from randomness extractors. Electronic Colloquium on Computational Complexity (ECCC)(145) (2005)

Tal Moran, Ronen Shaltiel, Amnon Ta-Shma: Non-interactive Timestamping in the Bounded Storage Model. CRYPTO 2004: 460-476

Ariel Gabizon, Ran Raz, Ronen Shaltiel: Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. FOCS 2004: 394-403

Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan: List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. TCC 2004: 101-120

Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel: Constant-Round Oblivious Transfer in the Bounded Storage Model. TCC 2004: 446-472

Ronen Shaltiel, Christopher Umans: Pseudorandomness for Approximate Counting and Sampling. Electronic Colloquium on Computational Complexity (ECCC)(086) (2004)

Iftach Haitner, Ronen Shaltiel: Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions. Electronic Colloquium on Computational Complexity (ECCC)(115) (2004)

Iftach Haitner, Ronen Shaltiel: Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions. IACR Cryptology ePrint Archive 2004: 335 (2004)

Ronen Shaltiel: Towards proving strong direct product theorems. Computational Complexity 12(1-2): 1-22 (2003)

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity 12(3-4): 85-130 (2003)

Boaz Barak, Ronen Shaltiel, Eran Tromer: True Random Number Generators Secure in a Changing Environment. CHES 2003: 166-180

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. IEEE Conference on Computational Complexity 2003: 33-47

Boaz Barak, Ronen Shaltiel, Avi Wigderson: Computational Analogues of Entropy. RANDOM-APPROX 2003: 200-215

Ronen Shaltiel: Recent Developments in Explicit Constructions of Extractors. Bulletin of the EATCS 77: 67-95 (2002)

Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel: Streaming Computation of Combinatorial Objects. IEEE Conference on Computational Complexity 2002: 165-174

Ronen Shaltiel: Towards Proving Strong Direct Product Theorems. IEEE Conference on Computational Complexity 2001: 107-117

Ronen Shaltiel, Christopher Umans: Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. FOCS 2001: 648-657

Ronen Shaltiel: Towards proving strong direct product theorems. Electronic Colloquium on Computational Complexity (ECCC) 8(9) (2001)

Omer Reingold, Ronen Shaltiel, Avi Wigderson: Extracting Randomness via Repeated Condensing. FOCS 2000: 22-31

Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Extractors and pseudo-random generators with optimal seed length. STOC 2000: 1-10

Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Extractors and pseudo-random generators with optimal seed length. Electronic Colloquium on Computational Complexity (ECCC) 7(9) (2000)

Omer Reingold, Ronen Shaltiel, Avi Wigderson: Extracting Randomness via Repeated Condensing. Electronic Colloquium on Computational Complexity (ECCC) 7(59) (2000)

Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Near-Optimal Conversion of Hardness into Pseudo-Randomness. FOCS 1999: 181-190