Back to Results
First PageMeta Content
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

Document Date: 2017-11-11 14:59:54


Open Document

File Size: 516,75 KB

Share Result on Facebook
UPDATE