| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ariel Gabizon, Ronen Shaltiel |
Increasing the output length of zero-error dispersers.  |
Random Struct. Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel |
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds. |
Computational Complexity |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola |
On beating the hybrid argument. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ronen Shaltiel |
Dispersers for affine sources with sub-polynomial entropy. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ronen Shaltiel |
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma. |
Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel |
An Introduction to Randomness Extractors. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei Artemenko, Ronen Shaltiel |
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel |
Dispersers for Affine Sources with Sub-polynomial Entropy. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel |
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola |
On beating the hybrid argument. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson |
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel |
Typically-correct derandomization. |
SIGACT News |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel, Emanuele Viola |
Hardness Amplification Proofs Require Majority. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel |
Derandomized Parallel Repetition Theorems for Free Games. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
Derandomization, Randomness extractors, Parallel repetition |
| 1 | Tal Moran, Ronen Shaltiel, Amnon Ta-Shma |
Non-interactive Timestamping in the Bounded-Storage Model. |
J. Cryptology |
2009 |
DBLP DOI BibTeX RDF |
Unbalanced expander graphs, Timestamping, Randomness extractors, Bounded-storage model |
| 1 | Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel |
Reducing Complexity Assumptions for Statistically-Hiding Commitment. |
J. Cryptology |
2009 |
DBLP DOI BibTeX RDF |
Statistical hiding, Regular one way functions, Bit commitment |
| 1 | Ronen Shaltiel, Christopher Umans |
Low-End Uniform Hardness versus Randomness Tradeoffs for AM. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Alon Rosen, Ronen Shaltiel |
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
Witness-Hiding, Arthur Merlin protocols, Zero-Knowledge, Black-box reductions |
| 1 | Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel |
Strong Parallel Repetition Theorem for Free Projection Games. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel |
Pseudorandom Generators and Typically-Correct Derandomization. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel |
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel |
How to get more mileage from randomness extractors. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ariel Gabizon, Ronen Shaltiel |
Increasing the Output Length of Zero-Error Dispersers. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel, Emanuele Viola |
Hardness amplification proofs require majority. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
amplification, natural proofs, black-box, hardness, average-case complexity, constant-depth circuits, majority |
| 1 | Ronen Shaltiel, Christopher Umans |
Low-end uniform hardness vs. randomness tradeoffs for AM. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ronen Shaltiel, Emanuele Viola |
Hardness amplification proofs require majority. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
68Q17, 68Q15, 94A60, Subject classification. 68Q10 |
| 1 | Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel |
Constant-Round Oblivious Transfer in the Bounded Storage Model. |
J. Cryptology |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel, Christopher Umans |
Low-end uniform hardness vs. randomness tradeoffs for AM. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
hardness vs. randomness tradeoff, hitting-set generator, derandomization, Arthur-Merlin games |
| 1 | Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson |
Reducing The Seed Length In The Nisan-Wigderson Generator. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q15 |
| 1 | Ronen Shaltiel, Christopher Umans |
Pseudorandomness for Approximate Counting and Sampling. |
Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
Subject classification, 68Q15 |
| 1 | Ariel Gabizon, Ran Raz, Ronen Shaltiel |
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Reingold, Ronen Shaltiel, Avi Wigderson |
Extracting Randomness via Repeated Condensing. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel |
How to Get More Mileage from Randomness Extractors. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
independent sources, extractors, dispersers, Ramsey graphs |
| 1 | Ariel Gabizon, Ran Raz, Ronen Shaltiel |
Deterministic Extractors for Bit-fixing Sources by Obtaining an Independent Seed |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ronen Shaltiel |
How to get more mileage from randomness extractors |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ronen Shaltiel, Christopher Umans |
Simple extractors for all min-entropies and a new pseudorandom generator. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
Hardness versus randomness, pseudorandom generator, randomness extractor |
| 1 | Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel |
Reducing Complexity Assumptions for Statistically-Hiding Commitment. |
EUROCRYPT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel, Christopher Umans |
Pseudorandomness for Approximate Counting and Sampling. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson |
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
dispersers condenser, constructions, extractors, explicit, ramsey graphs |
| 1 | Ronen Shaltiel, Christopher Umans |
Pseudorandomness for Approximate Counting and Sampling |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Ronen Shaltiel |
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Ronen Shaltiel |
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan |
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. |
TCC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel |
Constant-Round Oblivious Transfer in the Bounded Storage Model. |
TCC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Ronen Shaltiel, Amnon Ta-Shma |
Non-interactive Timestamping in the Bounded Storage Model. |
CRYPTO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ariel Gabizon, Ran Raz, Ronen Shaltiel |
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel |
Towards proving strong direct product theorems. |
Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 68Q17, 68Q15 |
| 1 | Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma |
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. |
Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 68Q15 |
| 1 | Boaz Barak, Ronen Shaltiel, Eran Tromer |
True Random Number Generators Secure in a Changing Environment. |
CHES |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Ronen Shaltiel, Avi Wigderson |
Computational Analogues of Entropy. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma |
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel |
Recent Developments in Explicit Constructions of Extractors. |
Bulletin of the EATCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel |
Streaming Computation of Combinatorial Objects. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
error-correcting codes, extractors, dispersers, streaming computation, universal hash functions, online computation |
| 1 | Ronen Shaltiel |
Towards proving strong direct product theorems |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Ronen Shaltiel, Christopher Umans |
Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel |
Towards Proving Strong Direct Product Theorems. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Reingold, Ronen Shaltiel, Avi Wigderson |
Extracting Randomness via Repeated Condensing |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson |
Extractors and pseudo-random generators with optimal seed length |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Omer Reingold, Ronen Shaltiel, Avi Wigderson |
Extracting Randomness via Repeated Condensing. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
repeated condensing, input probability distribution, maximum entropy rate, output distribution, block extraction scheme, recursive win-win case analysis, random sources, polynomial loss, computational complexity, probability, entropy, entropy, error correction, random processes, condenser, randomness extraction |
| 1 | Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson |
Extractors and pseudo-random generators with optimal seed length. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson |
Near-Optimal Conversion of Hardness into Pseudo-Randomness. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
Pseudo-Ranndom Generators, Derandomization |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")