scientific article
From MaRDI portal
Publication:3152800
zbMath1051.68070MaRDI QIDQ3152800
Publication date: 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (47)
Robustly reusable fuzzy extractor with imperfect randomness ⋮ Incompressible functions, relative-error extractors, and the power of nondeterministic reductions ⋮ From Affine to Two-Source Extractors via Approximate Duality ⋮ More efficient DDH pseudorandom generators ⋮ Deterministic extractors for affine sources over large fields ⋮ The entropy of a distributed computation random number generation from memory interleaving ⋮ Extracting Computational Entropy and Learning Noisy Linear Functions ⋮ A modular framework for quantum-proof randomness extractors ⋮ Our Data, Ourselves: Privacy Via Distributed Noise Generation ⋮ Certifiable quantum dice ⋮ 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction ⋮ Leakage Resilience of the Blom’s Key Distribution Scheme ⋮ Randomness – A Computational Complexity Perspective ⋮ Rainbow connections of graphs: a survey ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves ⋮ How to get more mileage from randomness extractors ⋮ Weak derandomization of weak algorithms: explicit versions of Yao's lemma ⋮ Computational fuzzy extractors ⋮ Increasing the Output Length of Zero-Error Dispersers ⋮ Deterministic extractors for small-space sources ⋮ Quantum Random Number Generation ⋮ Secure Random Number Generation in Continuous Variable Systems ⋮ Hierarchy Theorems for Property Testing ⋮ On Randomness Extraction in Elliptic Curves ⋮ An Introduction to Randomness Extractors ⋮ Improving the Hadamard extractor ⋮ Rainbow paths ⋮ A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes ⋮ Simple extractors via constructions of cryptographic pseudo-random generators ⋮ Dispersing hash functions ⋮ Unnamed Item ⋮ Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker ⋮ Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic ⋮ Constructive dimension and Turing degrees ⋮ The complexity of the matroid-greedoid partition problem ⋮ Extractors for binary elliptic curves ⋮ Non-interactive timestamping in the bounded-storage model ⋮ Dimension extractors and optimal decompression ⋮ A Sample of Samplers: A Computational Perspective on Sampling ⋮ Another Motivation for Reducing the Randomness Complexity of Algorithms ⋮ Computational Randomness from Generalized Hardcore Sets ⋮ Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators ⋮ Explicit two-source extractors and resilient functions ⋮ A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
This page was built for publication:
