The following pages link to Theory of Cryptography (Q5898368):
Displaying 30 items.
- On linear-size pseudorandom generators and hardcore functions (Q744085) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- The complexity of constructing pseudorandom generators from hard functions (Q1766819) (← links)
- Channels of small log-ratio leakage and characterization of two-party differentially private computation (Q2175926) (← 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)
- Simple constructions from (almost) regular one-way functions (Q2697872) (← links)
- Efficiency improvements in constructing pseudorandom generators from one-way functions (Q2848227) (← links)
- Efficiency improvements in constructing pseudorandom generators from one-way functions (Q2875171) (← links)
- A New Pseudorandom Generator from Collision-Resistant Hash Functions (Q2890004) (← links)
- A Remark on One-Wayness versus Pseudorandomness (Q2914351) (← links)
- Multi-input Functional Encryption with Unbounded-Message Security (Q2953788) (← links)
- Space pseudorandom generators by communication complexity lower bounds (Q2969656) (← links)
- Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure (Q2980880) (← links)
- Pseudoentropy: Lower-Bounds for Chain Rules and Transformations (Q3179357) (← links)
- On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (Q3297825) (← links)
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (Q3408197) (← links)
- Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint (Q3460111) (← links)
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (Q3591440) (← 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)
- Pseudorandom generators with long stretch and low locality from random local one-way functions (Q5415517) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- (Q6084358) (← links)
- Simple constructions from (almost) regular one-way functions (Q6570527) (← links)
- Counting unpredictable bits: a simple PRG from one-way functions (Q6581788) (← links)
- A direct PRF construction from Kolmogorov complexity (Q6637531) (← links)
