Pages that link to "Item:Q2848227"
From MaRDI portal
The following pages link to Efficiency improvements in constructing pseudorandom generators from one-way functions (Q2848227):
Displaying 19 items.
- Computational fuzzy extractors (Q2216116) (← links)
- Security levels in steganography -- insecurity does not imply detectability (Q2401760) (← 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)
- Simple constructions from (almost) regular one-way functions (Q2697872) (← links)
- Efficiency improvements in constructing pseudorandom generators from one-way functions (Q2875171) (← links)
- On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (Q3297825) (← links)
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (Q3591440) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- The Many Entropies in One-Way Functions (Q5021132) (← links)
- A tight lower bound for entropy flattening (Q5121911) (← links)
- Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols (Q5138779) (← links)
- (Q5140842) (← links)
- Pseudorandom generators with long stretch and low locality from random local one-way functions (Q5415517) (← links)
- Theory of Cryptography (Q5898368) (← links)
- (Q6084358) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
- Simple constructions from (almost) regular one-way functions (Q6570527) (← links)
- Counting unpredictable bits: a simple PRG from one-way functions (Q6581788) (← links)
