The following pages link to Pseudorandomness (Q2869768):
Displaying 36 items.
- Non-malleable coding against bit-wise and split-state tampering (Q514470) (← links)
- Model independent approach to probabilistic models (Q831149) (← links)
- Robustly reusable fuzzy extractor with imperfect randomness (Q831183) (← links)
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Stabilizing network bargaining games by blocking players (Q1801001) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- Constructing locally leakage-resilient linear secret-sharing schemes (Q2129019) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors (Q2229293) (← links)
- Lossless dimension expanders via linearized polynomials and subspace designs (Q2236661) (← links)
- Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP'' is not contained in P/poly (Q2328311) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- Grounding the randomness of quantum measurement (Q2955862) (← links)
- Cryptographic hash functions from sequences of lifted Paley graphs (Q2975257) (← links)
- On the Error-Correcting Radius of Folded Reed–Solomon Code Designs (Q3460451) (← links)
- Continuous Monitoring of l_p Norms in Data Streams (Q5002635) (← links)
- (Q5009525) (← links)
- (Q5009547) (← links)
- Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More (Q5041173) (← links)
- Organisational hierarchy constructions with easy Kuramoto synchronisation (Q5061360) (← links)
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes (Q5066947) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- (Q5092470) (← links)
- (Q5092476) (← links)
- Randomness in post-selected events (Q5855000) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- A construction of combinatorial NLTS (Q5882999) (← links)
- Quasirandomness in hypergraphs (Q5915722) (← links)
- Fragile complexity of adaptive algorithms (Q5918676) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
- Fragile complexity of adaptive algorithms (Q5925676) (← links)
- (Q6084346) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs (Q6494808) (← links)
