scientific article; zbMATH DE number 1301087
From MaRDI portal
Publication:4246732
Recommendations
- Computational indistinguishability: A sample hierarchy
- scientific article; zbMATH DE number 1335877
- A note on computational indistinguishability
- Computational indistinguishability: algorithms vs. circuits
- Computational Indistinguishability Between Quantum States and Its Cryptographic Application
- Computational indistinguishability between quantum states and its cryptographic application
- Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge
- Identifiability and distinguishability testing via computer algebra
- Bounded indistinguishability and the complexity of recovering secrets
Cited in
(6)- A tight computational indistinguishability bound for product distributions
- The complexity of deciding statistical properties of samplable distributions
- Computational indistinguishability: A sample hierarchy
- On the encoding invariance of polynomial time computable distribution ensembles
- Computational indistinguishability between quantum states and its cryptographic application
- A note on computational indistinguishability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246732)
