Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
From MaRDI portal
(Redirected from Publication:3452216)
Recommendations
Cited in
(84)- The complexity of the matroid-greedoid partition problem
- Non-interactive timestamping in the bounded-storage model
- How to extract useful randomness from unreliable sources
- Low error efficient computational extractors in the CRS model
- Side-channel masking with pseudo-random generator
- Non-malleability against polynomial tampering
- Expander-based cryptography meets natural proofs
- Game-theoretic fairness meets multi-party protocols: the case of leader election
- Improved computational extractors and their applications
- Adaptive extractors and their application to leakage resilient secret sharing
- A PCP theorem for interactive proofs and applications
- Immunization against complete subversion without random oracles
- Lossless dimension expanders via linearized polynomials and subspace designs
- Explicit two-source extractors and resilient functions
- Shift lifts preserving Ramanujan property
- From graphs to keyed quantum hash functions
- List-decoding Barnes-Wall lattices
- A combinatorial approach to quantum random functions
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Certifiable quantum dice
- Derandomized construction of combinatorial batch codes
- An introduction to randomness extractors
- A sample of samplers: a computational perspective on sampling
- Increasing the output length of zero-error dispersers
- Local correlation breakers and applications to three-source extractors and mergers
- Zero-fixing extractors for sub-logarithmic entropy
- Parallel Hashing via List Recoverability
- Increasing the Output Length of Zero-Error Dispersers
- Derandomized parallel repetition theorems for free games
- Submodular functions: learnability, structure, and optimization
- Flavors of compressive sensing
- Short lists for shortest descriptions in short time
- On low-risk heavy hitters and sparse recovery schemes
- Randomness extraction in \(\mathsf{AC}^0\) and with small locality
- Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions
- Quantified Derandomization: How to Find Water in the Ocean
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- Expander-Based Cryptography Meets Natural Proofs
- Construction of optimal locally recoverable codes and connection with hypergraph
- Non-malleable extractors and non-malleable codes: partially optimal constructions
- scientific article; zbMATH DE number 7561753 (Why is no real title available?)
- scientific article; zbMATH DE number 7561756 (Why is no real title available?)
- Local list recovery of high-rate tensor codes and applications
- scientific article; zbMATH DE number 7250144 (Why is no real title available?)
- Nonmalleable extractors and codes, with their many tampered extensions
- Extractor codes
- Certifiably pseudorandom financial derivatives
- Universal security for randomness expansion from the spot-checking protocol
- List Decoding and Pseudorandom Constructions
- Privacy amplification with asymptotically optimal entropy loss
- Unconditional UC-secure computation with (stronger-malicious) PUFs
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
- scientific article; zbMATH DE number 7650110 (Why is no real title available?)
- scientific article; zbMATH DE number 7650126 (Why is no real title available?)
- Extractors and lower bounds for locally samplable sources
- Four-state non-malleable codes with explicit constant rate
- scientific article; zbMATH DE number 7758332 (Why is no real title available?)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Simple Codes and Sparse Recovery with Fast Decoding
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
- Extractors: low entropy requirements colliding with non-malleability
- Paradigms for Unconditional Pseudorandom Generators
- Singleton-type bounds for list-decoding and list-recovery, and related results
- Almost Chor-Goldreich sources and adversarial random walks
- Nearly optimal pseudorandomness from hardness
- Seed-protecting extractors
- Two-source and affine non-malleable extractors for small entropy
- Optimal non-adaptive cell probe dictionaries and hashing
- Applications of random algebraic constructions to hardness of approximation
- Randomized vs. deterministic separation in time-space tradeoffs of multi-output functions
- Randomness extractors in AC^0 and NC^1: optimal up to constant factors
- Bounded-depth circuits cannot sample good codes
- Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
- Pseudo-random number generation with -encoders
- On exponential-time hypotheses, derandomization, and circuit lower bounds
- Universal almost optimal compression and Slepian-Wolf coding in probabilistic polynomial time
- Sharp threshold rates for random codes
- Improved streaming edge coloring
- Bit-fixing extractors for almost-logarithmic entropy
- Simplifying Armoni's PRG
- Near-optimal list-recovery of linear code families
- List-recovery of random linear codes over small fields
- Better short-seed quantum-proof extractors
- On rigid matrices and \(U\)-polynomials
This page was built for publication: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452216)
