Pseudorandomness
From MaRDI portal
Publication:2869768
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)
Recommendations
Cited in
(57)- Organisational hierarchy constructions with easy Kuramoto synchronisation
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Derandomizing Knockoffs
- Cryptographic hash functions from sequences of lifted Paley graphs
- Component stability in low-space massively parallel computation
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\)
- List Decoding and Pseudorandom Constructions
- Pseudo-randomness: objects and generation
- Model independent approach to probabilistic models
- Robustly reusable fuzzy extractor with imperfect randomness
- Indistinguishable predictions and multi-group fair learning
- Pseudorandomness and Combinatorial Constructions
- Grounding the randomness of quantum measurement
- A construction of combinatorial NLTS
- Strong blocking sets and minimal codes from expander graphs
- Quasirandomness in hypergraphs
- Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP is not contained in P/poly
- Paradigms for Unconditional Pseudorandom Generators
- Derandomizing local distributed algorithms under bandwidth restrictions
- Lossless dimension expanders via linearized polynomials and subspace designs
- Near-optimal distributed computation of small vertex cuts
- Multi-instance randomness extraction and security against bounded-storage mass surveillance
- scientific article; zbMATH DE number 7758305 (Why is no real title available?)
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
- scientific article; zbMATH DE number 7561753 (Why is no real title available?)
- Constructing locally leakage-resilient linear secret-sharing schemes
- scientific article; zbMATH DE number 7561748 (Why is no real title available?)
- The unified theory of pseudorandomness
- Nonmalleable digital lockers and robust fuzzy extractors in the plain model
- 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
- One-tape Turing machine and branching program lower bounds for MCSP
- Pseudorandom generators without the XOR lemma
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
- scientific article; zbMATH DE number 1833398 (Why is no real title available?)
- Optimal deterministic extractors for generalized Santha-Vazirani sources
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks
- Fragile complexity of adaptive algorithms
- Superfast coloring in CONGEST via efficient color sampling
- Stabilizing network bargaining games by blocking players
- Improved list-decodability of random linear binary codes
- Secure Sketch and Fuzzy Extractor with Imperfect Randomness: An Information-Theoretic Study
- Pseudorandom Generators and Typically-Correct Derandomization
- Rank-metric codes and their applications
- 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
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
- Fragile complexity of adaptive algorithms
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)
