scientific article; zbMATH DE number 1301087

zbMATH Open0925.68178MaRDI QIDQ4246732FDOQ4246732

Authors: Kaoru Kurosawa, Osamu Watanabe 

Publication date: 15 June 1999

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (6)

• Computational indistinguishability: A sample hierarchy
• The complexity of deciding statistical properties of samplable distributions
• On the encoding invariance of polynomial time computable distribution ensembles
• Computational indistinguishability between quantum states and its cryptographic application
• A note on computational indistinguishability
• A tight computational indistinguishability bound for product distributions

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)