Pages that link to "Item:Q5415517"
From MaRDI portal
The following pages link to Pseudorandom generators with long stretch and low locality from random local one-way functions (Q5415517):
Displaying 13 items.
- On the computational complexity of measuring global stability of banking networks (Q487019) (← links)
- On linear-size pseudorandom generators and hardcore functions (Q744085) (← links)
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\) (Q937192) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Improved filter permutators for efficient FHE: better instances and implementations (Q2179380) (← links)
- Answering \(n^2+o(1)\) counting queries with differential privacy is hard (Q2805511) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- A PRG for lipschitz functions of polynomials with applications to sparsest cut (Q5495770) (← links)
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator (Q6095188) (← links)
- Covercrypt: an efficient early-abort KEM for hidden access policies with traceability from the DDH and LWE (Q6550634) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
- Lossy cryptography from code-based assumptions (Q6652889) (← links)
- 10-party sublinear secure computation from standard assumptions (Q6653039) (← links)
