Pages that link to "Item:Q3183574"
From MaRDI portal
The following pages link to Computational Indistinguishability Amplification: Tight Product Theorems for System Composition (Q3183574):
Displayed 3 items.
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (Q3408197) (← links)
- The Iterated Random Permutation Problem with Applications to Cascade Encryption (Q3457118) (← links)