The following pages link to Ronen Shaltiel (Q301522):
Displaying 41 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- Constant-round oblivious transfer in the bounded storage model (Q877811) (← links)
- Reducing the seed length in the Nisan-Wigderson generator (Q879167) (← links)
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- Uniform hardness versus randomness tradeoffs for Arthur-Merlin games (Q1762663) (← links)
- Towards proving strong direct product theorems (Q1889851) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
- Channels of small log-ratio leakage and characterization of two-party differentially private computation (Q2175926) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Pseudorandomness for approximate counting and sampling (Q2460030) (← links)
- If NP languages are hard on the worst-case, then it is easy to find their hard instances (Q2475580) (← links)
- On beating the hybrid argument (Q2826078) (← links)
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction (Q2931427) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Increasing the output length of zero-error dispersers (Q3119044) (← links)
- (Q3152800) (← links)
- Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors (Q3167425) (← links)
- (Q3191596) (← links)
- Extractors and pseudo-random generators with optimal seed length (Q3191965) (← links)
- Parallel Hashing via List Recoverability (Q3457065) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- Simple extractors for all min-entropies and a new pseudorandom generator (Q3546310) (← links)
- (Q3549642) (← links)
- Low-End Uniform Hardness versus Randomness Tradeoffs for AM (Q3575157) (← links)
- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols (Q3611768) (← links)
- Strong Parallel Repetition Theorem for Free Projection Games (Q3638890) (← links)
- Pseudorandom Generators and Typically-Correct Derandomization (Q3638904) (← links)
- (Q4601848) (← links)
- (Q4636479) (← links)
- Pseudorandomness when the odds are against you (Q5368743) (← links)
- (Q6084353) (← links)
- Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)
- (Q6126362) (← links)
