Pseudorandomness
DOI10.1561/0400000010zbMATH Open1308.68011DBLPjournals/fttcs/Vadhan12OpenAlexW4205550388WikidataQ56058888 ScholiaQ56058888MaRDI QIDQ2869768FDOQ2869768
Authors: Salil Vadhan 
Publication date: 3 January 2014
Published in: Foundations and Trends in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/0400000010
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Decoding (94B35)
Cited In (57)
- List Decoding and Pseudorandom Constructions
- Pseudo-randomness: objects and generation
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\)
- Indistinguishable predictions and multi-group fair learning
- Pseudorandomness and Combinatorial Constructions
- Model independent approach to probabilistic models
- Robustly reusable fuzzy extractor with imperfect randomness
- Grounding the randomness of quantum measurement
- Strong blocking sets and minimal codes from expander graphs
- A construction of combinatorial NLTS
- Quasirandomness in hypergraphs
- Paradigms for Unconditional Pseudorandom Generators
- Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP is not contained in P/poly
- Derandomizing local distributed algorithms under bandwidth restrictions
- Near-optimal distributed computation of small vertex cuts
- Title not available (Why is that?)
- Lossless dimension expanders via linearized polynomials and subspace designs
- Title not available (Why is that?)
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
- Constructing locally leakage-resilient linear secret-sharing schemes
- Title not available (Why is that?)
- Nonmalleable digital lockers and robust fuzzy extractors in the plain model
- The unified theory of pseudorandomness
- Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates
- Fully adaptive decentralized multi-authority \textsf{ABE}
- Pseudorandomness
- New techniques and tighter bounds for local computation algorithms
- Pseudorandomness in computer science and in additive combinatorics
- Pseudorandom generators without the XOR lemma
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
- Title not available (Why is that?)
- Optimal deterministic extractors for generalized Santha-Vazirani sources
- Fragile complexity of adaptive algorithms
- Superfast coloring in CONGEST via efficient color sampling
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Improved list-decodability of random linear binary codes
- Stabilizing network bargaining games by blocking players
- Secure Sketch and Fuzzy Extractor with Imperfect Randomness: An Information-Theoretic Study
- Rank-metric codes and their applications
- Pseudorandom Generators and Typically-Correct Derandomization
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs
- Continuous monitoring of \(\ell_p\) norms in data streams
- On the error-correcting radius of folded Reed-Solomon code designs
- Leakage-resilient \textsf{IBE}/\textsf{ABE} with optimal leakage rates from lattices
- Typically-correct derandomization for small time and space
- Randomness in post-selected events
- A primer on pseudorandom generators
- Fragile complexity of adaptive algorithms
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
- Organisational hierarchy constructions with easy Kuramoto synchronisation
- Derandomizing Knockoffs
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Component stability in low-space massively parallel computation
- Cryptographic hash functions from sequences of lifted Paley graphs
- Multi-instance randomness extraction and security against bounded-storage mass surveillance
- One-tape Turing machine and branching program lower bounds for MCSP
- Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks
This page was built for publication: Pseudorandomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869768)
