How to extract useful randomness from unreliable sources
From MaRDI portal
Publication:2055615
DOI10.1007/978-3-030-45721-1_13zbMath1479.94102OpenAlexW2982590963MaRDI QIDQ2055615
Maciej Obremski, Ivan Visconti, Luisa Siniscalchi, Divesh Aggarwal, João L. Ribeiro
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_13
Related Items (5)
Improved computational extractors and their applications ⋮ Public randomness extraction with ephemeral roles and worst-case corruptions ⋮ On secret sharing, randomness, and random-less reductions for secret sharing ⋮ How to extract useful randomness from unreliable sources ⋮ Publicly verifiable zero knowledge from (collapsing) blockchains
Cites Work
- Affine extractors over large fields with exponential error
- Extractors and rank extractors for polynomial sources
- Affine extractors over prime fields
- Bit commitment using pseudorandomness
- On the construction of affine extractors
- Some extremal problems arising from discrete control processes
- Non-interactive zaps of knowledge
- Overcoming cryptographic impossibility results using blockchains
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
- Randomness is linear in space
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- How to extract useful randomness from unreliable sources
- Extractors for small zero-fixing sources
- Publicly verifiable proofs from blockchains
- Explicit two-source extractors and resilient functions
- Deterministic extractors for affine sources over large fields
- An improved analysis of linear mergers
- Point Obfuscation and 3-Round Zero-Knowledge
- Linear degree extractors and the inapproximability of max clique and chromatic number
- The Bitcoin Backbone Protocol: Analysis and Applications
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources
- Kakeya Sets, New Mergers, and Old Extractors
- Extractors for Turing-Machine Sources
- Local Correlation Breakers and Applications to Three-Source Extractors and Mergers
- Zero-Fixing Extractors for Sub-Logarithmic Entropy
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Analyzing linear mergers
- Extractors
- Extractors with weak random seeds
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Extractors for adversarial sources via extremal hypergraphs
- Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
- AN EXPLICIT TWO‐SOURCE EXTRACTOR WITH MIN‐ENTROPY RATE NEAR
- Analysis of the Blockchain Protocol in Asynchronous Networks
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Non-malleable extractors and codes, with their many tampered extensions
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Zaps and Their Applications
- Extractors for Circuit Sources
- New independent source extractors with exponential improvement
- The Efficient Construction of an Unbiased Random Sequence
- Non-interactive Zaps and New Techniques for NIZK
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Improved Extractors for Recognizable and Algebraic Sources
- Deterministic extractors for small-space sources
- Extractors and Lower Bounds for Locally Samplable Sources
- Simulating independence
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: How to extract useful randomness from unreliable sources
