The following pages link to (Q3152800):
Displayed 22 items.
- Constructive dimension and Turing degrees (Q733739) (← 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)
- Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (Q3408197) (← 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)
- 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)