Dwork, Cynthia; Stockmeyer, Larry 2-round zero knowledge and proof auditors. (English) Zbl 1192.68291 Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 322-331, electronic only (2002). For the entire collection see [Zbl 1074.68502]. Cited in 3 Documents MSC: 68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.) 68M12 Network protocols 68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) PDFBibTeX XMLCite \textit{C. Dwork} and \textit{L. Stockmeyer}, in: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, STOC 2002. Montreal, Quebec, Canada, May 19--21, 2002. New York, NY: ACM Press. 322--331 (2002; Zbl 1192.68291) Full Text: DOI