Efficient RAM and control flow in verifiable outsourced computation Riad S. Wahby⋆ , Srinath Setty† , Zuocheng Ren† , Andrew J. Blumberg† , and Michael Walfish⋆ ⋆ †

First Page		Document Content
Date: 2014-12-14 14:47:16 Computational complexity theory Theory of computation IP Proof of knowledge NP Zero-knowledge proof Certificate Theoretical computer science Applied mathematics		Efficient RAM and control flow in verifiable outsourced computation Riad S. Wahby⋆ , Srinath Setty† , Zuocheng Ren† , Andrew J. Blumberg† , and Michael Walfish⋆ ⋆ † Add to Reading List Source URL: cs.nyu.edu Download Document from Source Website File Size: 344,14 KB Share Document on Facebook

	Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai† DocID: 1xUdf - View Document
	Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-co DocID: 1xTKi - View Document
	PDF Document DocID: 1xSVG - View Document
	PDF Document DocID: 1xSM6 - View Document
	PDF Document DocID: 1xSJs - View Document