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

	INDEX THEORY AND GROUPOIDS CLAIRE DEBORD AND JEAN-MARIE LESCURE Abstract. These lecture notes are mainly devoted to a proof using groupoids and KK-theory of Atiyah and Singer’s index theorem on compact smooth manifolds DocID: 1xVj5 - View Document
	Author Proof A Specification Theory of Real-Time Processes Chris Chilton1 , Marta Kwiatkowska1 , Faron Moller2 , and Xu Wang2(B) 1 2 DocID: 1xUA7 - View Document
	Proof Articles Sharing Proofs Theory Packages DocID: 1vgUI - View Document
	The theory of canonical lifts for abelian varieties (draft version) Chloe Martindale February 10, 2016 These notes are from a talk at Leiden University, of which the aim was to understand Drinfeld’s proof of the Serre- DocID: 1uZwX - View Document
	A00137: Proof of Work as it relates to the theory of the firm. Proof of Work as it relates to the theory of the firm. DocID: 1uTc3 - View Document