Finite state verifiers II

DOI10.1145/146585.146601MaRDI QIDQ4302791zbMATH OpenOpenAlexFDO

Authors Cynthia Dwork, Larry J. Stockmeyer

Publication date 13 November 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/146585.146601

zbMATH Keywords

Arthur-Merlin gamescomplexity theoryfinite state automatainteractive proof systemsprobabilistic automatazero knowledge

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Formal languages and automata (68Q45)

Recommendations

• Finite state verifiers I
• scientific article; zbMATH DE number 4180787
• Statistical zero-knowledge languages can be recognized in two rounds
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Cited in

(4)

• An application of quantum finite automata to interactive proof systems
• Finite state verifiers with constant randomness
• scientific article; zbMATH DE number 4180787 (Why is no real title available?)
• Finite state verifiers I

This page was built for publication: Finite state verifiers II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302791)