How to extract useful randomness from unreliable sources
type: Item
instance of: scholarly article
title: How to extract useful randomness from unreliable sources
zbMATH Open document ID: 1479.94102
DOI: 10.1007/978-3-030-45721-1_13
author: Divesh Aggarwal
author: Maciej Obremski
author: Luisa Siniscalchi
author: Ivan Visconti
author: João L. Ribeiro
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436924
zbMATH Keywords: uniform randomness
zbMATH Keywords: somewhere-extraction
zbMATH Keywords: SHELA
MaRDI profile type: Publication
full work available at URL: 978-3-030-45721-1 13
OpenAlex ID: W2982590963
cites work: Simulating independence
cites work: 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
cites work: Q5009525
cites work: Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources
cites work: NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
cites work: Q5121891
cites work: Point Obfuscation and 3-Round Zero-Knowledge
cites work: Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
cites work: MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
cites work: On the construction of affine extractors
cites work: Affine extractors over large fields with exponential error
cites work: Extractors for adversarial sources via extremal hypergraphs
cites work: Non-malleable extractors and codes, with their many tampered extensions
cites work: Explicit two-source extractors and resilient functions
cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
cites work: Local Correlation Breakers and Applications to Three-Source Extractors and Mergers
cites work: Zero-Fixing Extractors for Sub-Logarithmic Entropy
cites work: Extractors and Lower Bounds for Locally Samplable Sources
cites work: Q4535025
cites work: Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
cites work: Extractors and rank extractors for polynomial sources
cites work: Analyzing linear mergers
cites work: An improved analysis of linear mergers
cites work: Kakeya Sets, New Mergers, and Old Extractors
cites work: Zaps and Their Applications
cites work: The Efficient Construction of an Unbiased Random Sequence
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: Non-interactive zaps of knowledge
cites work: Deterministic extractors for affine sources over large fields
cites work: Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
cites work: The Bitcoin Backbone Protocol: Analysis and Applications
cites work: Overcoming cryptographic impossibility results using blockchains
cites work: Non-interactive Zaps and New Techniques for NIZK
cites work: Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
cites work: Deterministic extractors for small-space sources
cites work: Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
cites work: AN EXPLICIT TWO‐SOURCE EXTRACTOR WITH MIN‐ENTROPY RATE NEAR
cites work: Improved Extractors for Recognizable and Algebraic Sources
cites work: New independent source extractors with exponential improvement
cites work: Some extremal problems arising from discrete control processes
cites work: Extractors
cites work: Bit commitment using pseudorandomness
cites work: Q5810192
cites work: Randomness is linear in space
cites work: Analysis of the Blockchain Protocol in Asynchronous Networks
cites work: Extractors for small zero-fixing sources
cites work: Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
cites work: Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
cites work: Extractors with weak random seeds
cites work: Publicly verifiable proofs from blockchains
cites work: Q4228480
cites work: Extractors for Turing-Machine Sources
cites work: Extractors for Circuit Sources
cites work: Affine extractors over prime fields
cites work: Linear degree extractors and the inapproximability of max clique and chromatic number
description: scientific article; zbMATH DE number 7436924