Proofless Verifiable Computation from Integer Factoring

ePrint Report: Proofless Verifiable Computation from Integer Factoring

Alex Dalton, David Thomas, Peter Cheung

VC schemes provide a mechanism for verifying the output of a remotely executed program. These are used to support computing paradigms wherein a computationally restricted client, the Verifier, wishes to delegate work to a more powerful but untrusted server, the Prover. The Verifier wishes to detect any incorrect results, be they accidental or malicious. The current state-of-the-art is only close-to-practical, usually because of a computationally demanding …

alex art client computation computing current detect eprint report factoring integer malicious peter program report restricted results server state support thomas untrusted work