scientific article; zbMATH DE number 1256785

zbMATH Open0922.68049MaRDI QIDQ4228522FDOQ4228522

Authors: Tatsuaki Okamoto 

Publication date: 1 March 1999

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

Recommendations

• On relationships between statistical zero-knowledge proofs
• Statistical zero-knowledge languages can be recognized in two rounds
• A complete problem for statistical zero knowledge
• Publication:4941874

zbMATH Keywords

statistical zero-knowledge interactive proofs

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Knowledge representation (68T30)

Cited In (16)

• Title not available (Why is that?)
• Resettable statistical zero knowledge
• Interactive and probabilistic proof-checking
• On relationships between statistical zero-knowledge proofs
• On the power of statistical zero knowledge
• An Unconditional Study of Computational Zero Knowledge
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• On the relationship between statistical zero-knowledge and statistical randomized encodings
• Kolmogorov complexity characterizes statistical zero knowledge
• Statistical zero-knowledge languages can be recognized in two rounds
• On the limits of nonapproximability of lattice problems
• Advances in Cryptology - ASIACRYPT 2003
• Title not available (Why is that?)
• On the complexity of computational problems regarding distributions
• Brief announcement: Zero-knowledge protocols for search problems
• Robustness for space-bounded statistical zero knowledge

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 Q4228522)