Pages that link to "Item:Q1305929"
From MaRDI portal
The following pages link to Extracting randomness: A survey and new constructions (Q1305929):
Displaying 33 items.
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- Improving the Hadamard extractor (Q1758168) (← links)
- On the complexity of approximating the VC dimension. (Q1872731) (← links)
- On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments (Q2044755) (← links)
- Semi-device-independent randomness certification with partially free random sources using \(4\rightarrow 1\) quantum random access code (Q2102243) (← links)
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness (Q2175944) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage (Q2279660) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- Randomness extractors -- applications and constructions (Q2920153) (← links)
- Randomness and Dependencies Extraction via Polarization, With Applications to Slepian–Wolf Coding and Secrecy (Q2978613) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Randomness extraction in finite fields F_{p^n} (Q3191707) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- Simple extractors for all min-entropies and a new pseudorandom generator (Q3546310) (← links)
- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators (Q3644215) (← links)
- (Q4228481) (← links)
- Randomization and eventual reordering: a number theoretic approach (Q4457588) (← links)
- (Q4691630) (← links)
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators (Q4943700) (← links)
- Quantum Cryptography: Key Distribution and Beyond (Q5134949) (← links)
- Dimension, Pseudorandomness and Extraction of Pseudorandomness (Q5275369) (← links)
- Proved Random Numbers Obtained from Hardware Devices (Q5415900) (← links)
- Optimal Coin Flipping (Q5418975) (← links)
- Extracting Randomness via Repeated Condensing (Q5470730) (← links)
- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND (Q5857004) (← links)
- Deterministic extractors for small-space sources (Q5894074) (← links)
- Coalgebraic tools for randomness-conserving protocols (Q5925546) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Source-device-independent randomness expansion using quantum random access codes (Q6098269) (← links)
- Random sources in private computation (Q6135406) (← links)