scientific article; zbMATH DE number 4180787

zbMATH Open0716.68033MaRDI QIDQ3204032FDOQ3204032

Authors Cynthia Dwork, Larry J. Stockmeyer

Publication date 1990

zbMATH Keywords

zero knowledgeinteractive proof systems2-way probabilistic finite state automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Finite state verifiers II
• Noninteractive Zero-Knowledge
• Finite state verifiers I
• The knowledge complexity of interactive proof-systems
• Statistical zero-knowledge languages can be recognized in two rounds

Cited in

(3)

• Multi-oracle interactive protocols with constant space verifiers
• On some variations of two-way probabilistic finite automata models
• Lower space bounds for randomized computation

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