Pages that link to "Item:Q1100894"
From MaRDI portal
The following pages link to One way functions and pseudorandom generators (Q1100894):
Displaying 27 items.
- Algebraic cryptography: new constructions and their security against provable break (Q3079281) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Query Complexity in Errorless Hardness Amplification (Q3088136) (← links)
- Three XOR-Lemmas — An Exposition (Q3088188) (← links)
- On Yao’s XOR-Lemma (Q3088189) (← links)
- On Security Preserving Reductions – Revised Terminology (Q3088200) (← links)
- Simultaneous Secrecy and Reliability Amplification for a General Channel Model (Q3179359) (← links)
- ON THE CIRCUIT-SIZE OF INVERSES (Q3224957) (← links)
- A Feebly Secure Trapdoor Function (Q3392948) (← links)
- Efficient Pseudorandom Functions via On-the-Fly Adaptation (Q3457117) (← links)
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (Q3591440) (← links)
- How to construct random functions (Q3729902) (← links)
- Sparse pseudorandom distributions (Q3990219) (← links)
- The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> (Q4953205) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- (Q5150466) (← links)
- (Q5150533) (← links)
- Semigroups and one-way functions (Q5246500) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- Degradation and Amplification of Computational Hardness (Q5445529) (← links)
- Theory of Cryptography (Q5898368) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Easiness assumptions and hardness tests: Trading time for zero error (Q5956013) (← links)
- A tight computational indistinguishability bound for product distributions (Q6114275) (← links)
- Structural lower bounds on black-box constructions of pseudorandom functions (Q6652977) (← links)
- On central primitives for quantum cryptography with classical communication (Q6653009) (← links)
