The KnowledgeComplexity of Interactive Proof-Systems (ExtendedAbstract) ShafiGoldwasser SilvioMicali CharlesRackoff MIT MIT Universityof Toronto

First Page		Document Content
Date: 2005-09-09 15:31:38 Computational complexity theory Theory of computation Complexity classes Randomized algorithms Models of computation IP NP ArthurMerlin protocol Interactive proof system BPP PP Zero-knowledge proof		The KnowledgeComplexity of Interactive Proof-Systems (ExtendedAbstract) ShafiGoldwasser SilvioMicali CharlesRackoff MIT MIT Universityof Toronto Add to Reading List Source URL: groups.csail.mit.edu Download Document from Source Website File Size: 1,32 MB Share Document on Facebook

	Logical Methods in Computer Science Vol. 10(1:, pp. 1–29 www.lmcs-online.org Submitted Published DocID: 1xTZi - View Document
	Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted Published DocID: 1xTH1 - View Document
	PP_icon-1_Einladung_A4_L3.indd DocID: 1xTEi - View Document
	ADVANCE INFORMATION 100 POEMS ARE NOT ENOUGHNon-Fiction > Poetry Walking BookFairs-PAN ǀ Rs 299 ǀ 104 pp DocID: 1xTyC - View Document
	Logical Methods in Computer Science Vol. 4 (4:, pp. 1–21 www.lmcs-online.org Submitted Published DocID: 1xTht - View Document