Pages that link to "Item:Q5441361"

The following pages link to Extractors and pseudorandom generators (Q5441361):

Displaying 45 items.

• On uniformity and circuit lower bounds (Q488049) (← links)
• Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
• Better short-seed quantum-proof extractors (Q764353) (← links)
• The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
• Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
• 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
• Towards efficient LPN-based symmetric encryption (Q2117050) (← links)
• On explicit constructions of designs (Q2121799) (← links)
• Expander-based cryptography meets natural proofs (Q2125080) (← links)
• Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
• Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
• Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← links)
• Explicit two-source extractors and resilient functions (Q2320598) (← links)
• Reconstructive dispersers and hitting set generators (Q2391190) (← links)
• A modular framework for quantum-proof randomness extractors (Q2400201) (← links)
• List-decoding Barnes-Wall lattices (Q2410678) (← links)
• Extractors from Reed-Muller codes (Q2496317) (← links)
• On the complexity of constructing pseudorandom functions (especially when they don't exist) (Q2516523) (← links)
• Resource bounded symmetry of information revisited (Q2575757) (← links)
• Cryptography from one-way communication: on completeness of finite channels (Q2691601) (← links)
• An Introduction to Randomness Extractors (Q3012907) (← links)
• How to get more mileage from randomness extractors (Q3522834) (← links)
• Simple extractors for all min-entropies and a new pseudorandom generator (Q3546310) (← links)
• Extractors with weak random seeds (Q3581381) (← links)
• (Q4691630) (← links)
• (Q5009532) (← links)
• Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
• Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
• (Q5090431) (← links)
• (Q5092448) (← links)
• Set-Codes with Small Intersections and Small Discrepancies (Q5112823) (← links)
• Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
• Nonmalleable Extractors and Codes, with Their Many Tampered Extensions (Q5129235) (← links)
• Dimension, Pseudorandomness and Extraction of Pseudorandomness (Q5275369) (← links)
• Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
• THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT (Q5413307) (← links)
• Two-Source Randomness Extractors for Elliptic Curves for Authenticated Key Exchange (Q5739025) (← links)
• Deterministic extractors for small-space sources (Q5894074) (← links)
• Pseudo-random generators for all hardnesses (Q5917585) (← links)
• Short leakage resilient and non-malleable secret sharing schemes (Q6097261) (← links)
• On secret sharing, randomness, and random-less reductions for secret sharing (Q6114236) (← links)
• Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
• New concepts and construction of quantum random number generators (Q6498713) (← links)
• Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
• Bicorn: an optimistically efficient distributed randomness beacon (Q6573968) (← links)