The following pages link to (Q3152800):
Displaying 46 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)
- Constructive dimension and Turing degrees (Q733739) (← links)
- Robustly reusable fuzzy extractor with imperfect randomness (Q831183) (← links)
- Rainbow paths (Q965956) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- Extractors for binary elliptic curves (Q1009079) (← links)
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- The entropy of a distributed computation random number generation from memory interleaving (Q1656885) (← links)
- Improving the Hadamard extractor (Q1758168) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- A modular framework for quantum-proof randomness extractors (Q2400201) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Certifiable quantum dice (Q2941597) (← links)
- Leakage Resilience of the Blom’s Key Distribution Scheme (Q2948266) (← links)
- On Randomness Extraction in Elliptic Curves (Q3011919) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Dispersing hash functions (Q3055765) (← links)
- A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
- Another Motivation for Reducing the Randomness Complexity of Algorithms (Q3088202) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- Quantum Random Number Generation (Q3296711) (← links)
- Secure Random Number Generation in Continuous Variable Systems (Q3296717) (← links)
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (Q3408197) (← links)
- From Affine to Two-Source Extractors via Approximate Duality (Q3451757) (← links)
- Randomness – A Computational Complexity Perspective (Q3503618) (← links)
- Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves (Q3511181) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- Our Data, Ourselves: Privacy Via Distributed Noise Generation (Q3593113) (← links)
- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators (Q3644215) (← links)
- A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes (Q4931664) (← links)
- Hierarchy Theorems for Property Testing (Q4933380) (← links)
- (Q5092448) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker (Q5445521) (← links)
- Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic (Q5448546) (← links)
- Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? (Q5505474) (← links)
- Deterministic extractors for small-space sources (Q5894074) (← links)
