Making Argument Systems for Outsourced Computation Practical (Sometimes) Srinath Setty, Richard McPherson, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin Abstract This paper describes the desig

First Page		Document Content
Date: 2017-11-11 14:59:54 Cryptography Computational complexity theory Randomized algorithms Complexity classes Probabilistically checkable proof Proof theory IP NP NEXPTIME Soundness PCP theorem Commitment scheme		Making Argument Systems for Outsourced Computation Practical (Sometimes) Srinath Setty, Richard McPherson, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin Abstract This paper describes the desig Add to Reading List Source URL: www.pepper-project.org Download Document from Source Website File Size: 516,75 KB Share Document on Facebook

	Local Soundness for QBF Calculi? Martin Suda and Bernhard Gleiss TU Wien, Vienna, Austria Abstract. We develop new semantics for resolution-based calculi for Quantified Boolean Formulas, covering both the CDCL-derived ca DocID: 1xVIK - View Document
	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Self-Formalisation of Higher-Order Logic Semantics, Soundness, and a Verified Implementation Ramana Kumar · Rob Arthan · DocID: 1xV5B - View Document
	Type Soundness for Dependent Object Types (DOT) * Complete We sis DocID: 1xUdC - View Document
	HOL with Definitions: Semantics, Soundness, and a Verified Implementation Ramana Kumar1 , Rob Arthan2 , Magnus O. Myreen1 , and Scott Owens3 2 1 DocID: 1xTFM - View Document
	Type Soundness for DOT (Dependent Object Types) Tiark Rompf Nada Amin DocID: 1xTuC - View Document