Pages that link to "Item:Q2875171"
From MaRDI portal
The following pages link to Efficiency improvements in constructing pseudorandom generators from one-way functions (Q2875171):
Displaying 19 items.
- On linear-size pseudorandom generators and hardcore functions (Q744085) (← links)
- Practical construction and analysis of pseudo-randomness primitives (Q2482337) (← links)
- Pseudorandom generators from regular one-way functions: new constructions with improved parameters (Q2513673) (← links)
- On the complexity of constructing pseudorandom functions (especially when they don't exist) (Q2516523) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- Homomorphic Evaluation Requires Depth (Q2796133) (← links)
- Efficiency improvements in constructing pseudorandom generators from one-way functions (Q2848227) (← links)
- A New Pseudorandom Generator from Collision-Resistant Hash Functions (Q2890004) (← links)
- The Chain Rule for HILL Pseudoentropy, Revisited (Q2946442) (← links)
- Metric Pseudoentropy: Characterizations, Transformations and Applications (Q2947525) (← links)
- On Constructing 1-1 One-Way Functions (Q3088171) (← links)
- Pseudoentropy: Lower-Bounds for Chain Rules and Transformations (Q3179357) (← links)
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (Q3591440) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- A tight lower bound for entropy flattening (Q5121911) (← links)
- Pseudorandom generators with long stretch and low locality from random local one-way functions (Q5415517) (← links)
- Theory of Cryptography (Q5898368) (← links)
- A direct PRF construction from Kolmogorov complexity (Q6637531) (← links)
- On central primitives for quantum cryptography with classical communication (Q6653009) (← links)
