Back to Results
First PageMeta Content
Cryptography / Computational complexity theory / Complexity classes / Public-key cryptography / Interactive proof system / NP / NEXPTIME / IP / Probabilistically checkable proof / Commitment scheme / Proof of secure erasure / Randomized algorithm


Toward practical and unconditional verification of remote computations Srinath Setty∗, Andrew J. Blumberg∗, and Michael Walfish∗ 1 Introduction
Add to Reading List

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


Open Document

File Size: 151,71 KB

Share Result on Facebook