Pages that link to "Item:Q5313037"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313037):
Displayed 15 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- On hardening leakage resilience of random extractors for instantiations of leakage-resilient cryptographic primitives (Q726335) (← links)
- Robustly reusable fuzzy extractor with imperfect randomness (Q831183) (← links)
- Rainbow paths (Q965956) (← links)
- Improving the Hadamard extractor (Q1758168) (← links)
- Leakage-resilient key exchange and two-seed extractors (Q2096493) (← links)
- Post-challenge leakage in public-key encryption (Q2257289) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- Pseudorandom generators from regular one-way functions: new constructions with improved parameters (Q2513673) (← links)
- Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources (Q2794527) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- (Q5090419) (← links)
- Extractors and Lower Bounds for Locally Samplable Sources (Q5894225) (← links)
- Coalgebraic tools for randomness-conserving protocols (Q5925546) (← links)