Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
From MaRDI portal
Recommendations
- Bounds on tradeoffs between randomness and communication complexity
- Communication Complexity and Quasi Randomness
- Communication and Randomness Lower Bounds for Secure Computation
- Communication complexity with defective randomness
- Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- Sharp lower bounds on the extractable randomness from non-uniform sources
- Secrecy without perfect randomness: cryptography with (bounded) weak sources
- Private vs. common random bits in communication complexity
- Making randomness public in unbounded-round information complexity
Cited in
(only showing first 100 items - show all)- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Extracting randomness: A survey and new constructions
- Universal tests for nonuniform distributions
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity
- Efficient learning of typical finite automata from random walks
- On the power of circuits with gates of low \(L_{1}\) norms.
- Approximation of boolean functions by combinatorial rectangles
- One-message zero knowledge and non-malleable commitments
- Improving the Hadamard extractor
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
- Simulating BPP using a general weak random source
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Isolation, matching, and counting uniform and nonuniform upper bounds
- The hardest halfspace
- The Paley graph conjecture and Diophantine \(m\)-tuples
- Reusable fuzzy extractors for low-entropy distributions
- Extracting randomness from extractor-dependent sources
- How to extract useful randomness from unreliable sources
- Multi-source non-malleable extractors and applications
- Non-malleability against polynomial tampering
- Improved computational extractors and their applications
- No time to hash: on super-efficient entropy accumulation
- Communication complexity with small advantage
- Learning under \(p\)-tampering poisoning attacks
- On the restricted isometry property of the Paley matrix
- Post-challenge leakage in public-key encryption
- Explicit two-source extractors and resilient functions
- Cancellation-free circuits in unbounded and bounded depth
- Deterministic extractors for affine sources over large fields
- Simpler session-key generation from short random passwords
- Extractors from Reed-Muller codes
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- On the binary and Boolean rank of regular matrices
- Leakage-resilient cryptography over large finite fields: theory and practice
- Upper and lower bounds on the power of advice
- The multiparty communication complexity of set disjointness
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- A lower bound for depth-3 circuits with MOD m gates
- Leakage resilience of the Blom's key distribution scheme
- Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources
- Space Lower Bounds for Online Pattern Matching
- An introduction to randomness extractors
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Increasing the output length of zero-error dispersers
- Tightly secure signatures from lossy identification schemes
- Local correlation breakers and applications to three-source extractors and mergers
- Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources
- Zero-fixing extractors for sub-logarithmic entropy
- How to Compute in the Presence of Leakage
- From affine to two-source extractors via approximate duality
- Privacy with Imperfect Randomness
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- How to get more mileage from randomness extractors
- Increasing the Output Length of Zero-Error Dispersers
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators
- Hadamard tensors and lower bounds on multiparty communication complexity
- Quantum entanglement and the communication complexity of the inner product function
- Space lower bounds for online pattern matching
- Linear algebraic methods in communication complexity
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma
- On multiparty communication with large versus unbounded error
- Lower bounds for one-way probabilistic communication complexity
- Interleaved Group Products
- Communication complexity of matrix computation over finite fields
- On extractors and exposure-resilient functions for sublogarithmic entropy
- Distinguishing distributions using Chernoff information
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0
- The NOF multiparty communication complexity of composed functions
- Approximating rectangles by juntas and weakly exponential lower bounds for LP relaxations of CSPs
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
- Optimal deterministic extractors for generalized Santha-Vazirani sources
- Commutative algorithms approximate the LLL-distribution
- Sunflowers and quasi-sunflowers from randomness extractors
- The many entropies in one-way functions
- Information lower bounds via self-reducibility
- Extractors for weak random sources and their applications
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- How to subvert backdoored encryption: security against adversaries that decrypt all ciphertexts
- Time-space lower bounds for two-pass learning
- Non-malleable extractors and non-malleable codes: partially optimal constructions
- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- Sign rank vs discrepancy
- scientific article; zbMATH DE number 7561753 (Why is no real title available?)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing
- scientific article; zbMATH DE number 7250143 (Why is no real title available?)
- Nonmalleable extractors and codes, with their many tampered extensions
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier
- Extracting Computational Entropy and Learning Noisy Linear Functions
- An additive combinatorics approach relating rank to communication complexity
- Communication lower bounds using directional derivatives
- scientific article; zbMATH DE number 7650110 (Why is no real title available?)
- Improved Extractors for Recognizable and Algebraic Sources
- Rectangles are nonnegative juntas
- Deterministic extractors for small-space sources
- Extractors and lower bounds for locally samplable sources
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Extractors in Paley graphs: a random model
- On secret sharing, randomness, and random-less reductions for secret sharing
This page was built for publication: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787911)
