- Computational Analogues of Entropy Boaz Barak 1 , Ronen Shaltiel 1 , and Avi Wigderson 2
- How to get more mileage from randomness extractors Ronen Shaltiel #
- Hardness Amplification Proofs Require Majority Ronen Shaltiel #
- Towards proving strong direct product theorems Ronen Shaltiel
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification
- Low-end Uniform Hardness vs. Randomness Tradeoffs for AM
- Extracting Randomness via Repeated Condensing Omer Reingold
- Reducing Complexity Assumptions for StatisticallyHiding Commitment #
- Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and
- Deterministic extractors for bitfixing sources by obtaining an independent seed Ariel Gabizon #
- NonInteractive Timestamping in the Bounded Storage Model
- Reducing Complexity Assumptions for StatisticallyHiding Commitment
- Non-Interactive Timestamping in the Bounded Storage Model Ronen Shaltiel
- 2Source Dispersers for n o(1) Entropy, and Ramsey Graphs Beating the FranklWilson Construction
- Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors #
- Lowend uniform hardness vs. randomness tradeoffs for AM
- Reducing the seed length in the NisanWigderson generator # Russell Impagliazzo +
- If NP languages are hard on the worstcase then it is easy to nd their hard Dan Gutfreund #
- 2-Source Dispersers for Sub-Polynomial Entropy and Ramsey Graphs Beating the Frankl-Wilson Construction
- UNIFORM HARDNESS VERSUS RANDOMNESS TRADEOFFS FOR ARTHUR-MERLIN GAMES
- Explicit constructions of pseudorandom generators and extractors
- Derandomizing BPP Lecture Notes of a course by Avi Wigderson
- On beating the hybrid argument Bill Fefferman
- Hardness Amplification Proofs Require Majority Ronen Shaltiel
- Pseudorandomness for Approximate Counting and Sampling Ronen Shaltiel #
- Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and
- Recent developments in explicit constructions of extractors Ronen Shaltiel #
- NonInteractive Timestamping in the Bounded Storage Model # Tal Moran + Ronen Shaltiel # Amnon TaShma
- Increasing the Output Length of ZeroError Ariel Gabizon 1 and Ronen Shaltiel 2
- How to get more mileage from randomness extractors # Ronen Shaltiel +
- Extractors and pseudorandom generators with optimal seed length
- How to get more mileage from randomness extractors Ronen Shaltiel
- IF NP LANGUAGES ARE HARD ON THE WORST-CASE, THEN IT IS EASY TO
- Simple Extractors for All MinEntropies and a New PseudoRandom Generator
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma
- 2Source Dispersers for SubPolynomial Entropy and Ramsey Graphs Beating the FranklWilson Construction
- Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors
- Simple Extractors for All MinEntropies and a New Pseudorandom Generator #
- Uniform hardness vs. randomness tradeo s for Arthur-Merlin games Dan Gutfreund
- Derandomized parallel repetition theorems for free games Ronen Shaltiel
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma
- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
- Derandomized parallel repetition theorems for free games Ronen Shaltiel
- Pseudorandom Generators and Typically-Correct Derandomization
- Increasing the Output Length of Zero-Error Ariel Gabizon1
- Increasing the Output Length of Zero-Error Dispersers Ariel Gabizon
- Hardness Amplification Proofs Require Majority Ronen Shaltiel
- Reducing Complexity Assumptions for Statistically-Hiding Iftach Haitner
- Pseudorandomness for Approximate Counting and Sampling Ronen Shaltiel
- Typically-correct derandomization Ronen Shaltiel
- Lowend Uniform Hardness vs. Randomness Tradeoffs for AM
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification
- An introduction to randomness extractors Ronen Shaltiel
- Computational Analogues of Entropy Ronen Shaltiel
- Dispersers for Affine Sources with Sub-Polynomial Entropy Ronen Shaltiel
- Dispersers for affine sources with sub-polynomial entropy Ronen Shaltiel
