Pages that link to "Item:Q3408197"
From MaRDI portal
The following pages link to A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (Q3408197):
Displaying 4 items.
- Distinguishing two probability ensembles with one sample from each ensemble (Q503466) (← links)
- Unifying leakage models: from probing attacks to noisy leakage (Q1715856) (← links)
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
- Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy (Q2947526) (← links)
