The Art of Cryptography Zero Knowledge Proofs Abhiram Kothapalli Two Balls and the Color-Blind Friend

First Page		Document Content
Date: 2018-10-12 13:22:58 Cryptography Proof theory Computational complexity theory Zero-knowledge proof Complexity classes Soundness IP Zero knowledge Interactive proof system PSPACE Mathematical proof Proof of knowledge		The Art of Cryptography Zero Knowledge Proofs Abhiram Kothapalli Two Balls and the Color-Blind Friend Add to Reading List Source URL: abhiram.me Download Document from Source Website File Size: 4,26 MB Share Document on Facebook

	Model Checking Probabilistic Knowledge: A PSPACE Case Xiaowei Huang and Marta Kwiatkowska University of Oxford, UK Abstract Model checking probabilistic knowledge of memoryful semantics is undecidable, even for a simple DocID: 1xVvn - View Document
	Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete Michael Blondin1, 2 Alain Finkel1 DocID: 1vlLP - View Document
	Subway Shuffle is PSPACE–complete (Preliminary draft) Marzio De Biasi∗ Tim Ophelders† DocID: 1viyb - View Document
	Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances Paul Bonsma∗ Institut f¨ ur Mathematik, Sekr. MA 6-1, Technische Universit¨at Berlin, DocID: 1uVHn - View Document
	Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete Michael Blondin∗†‡ , Alain Finkel†§ , Stefan G¨oller†¶k , Christoph Haase†§k and Pierre McKenzie∗†∗∗ ∗ DIRO DocID: 1uHDR - View Document