Distinguishing two probability ensembles with one sample from each ensemble
From MaRDI portal
(Redirected from Publication:503466)
Recommendations
Cites work
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
- Communication Complexity
- Communication complexity in a 3-computer model
- Computational indistinguishability: A sample hierarchy
- Computational indistinguishability: algorithms vs. circuits
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256775 (Why is no real title available?)
- scientific article; zbMATH DE number 1769898 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
Cited in
(3)
This page was built for publication: Distinguishing two probability ensembles with one sample from each ensemble
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503466)