Skip to Main content Skip to Navigation
Conference papers

Proof-of-work certificates that can be efficiently computed in the cloud

Abstract : In an emerging computing paradigm, computational capabilities, from processing power to storage capacities, are offered to users over communication networks as a cloud-based service. There, demanding computations are outsourced in order to limit infrastructure costs. The idea of verifiable computing is to associate a data structure, a proof-of-work certificate, to the result of the outsourced computation. This allows a verification algorithm to prove the validity of the result, faster than by recomputing it. We talk about a Prover (the server performing the computations) and a Verifier. Goldwasser, Kalai and Rothblum gave in 2008 a generic method to verify any parallelizable computation, in almost linear time in the size of the, potentially structured, inputs and the result. However, the extra cost of the computations for the Prover (and therefore the extra cost to the customer), although only almost a constant factor of the overall work, is nonetheless prohibitive in practice. Differently, we will here present problem-specific procedures in computer algebra, e.g. for exact linear algebra computations, that are Prover-optimal, that is that have much less financial overhead.
Complete list of metadata

Cited literature [64 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01825779
Contributor : Jean-Guillaume Dumas <>
Submitted on : Wednesday, July 18, 2018 - 3:58:47 PM
Last modification on : Tuesday, May 11, 2021 - 11:37:30 AM
Long-term archiving on: : Friday, October 19, 2018 - 10:33:36 PM

Identifiers

Collections

Citation

Jean-Guillaume Dumas. Proof-of-work certificates that can be efficiently computed in the cloud. The 20th International Workshop on Computer Algebra in Scientific Computing, Sep 2018, Lille, France. pp.1-17, ⟨10.1007/978-3-319-99639-4_1⟩. ⟨hal-01825779v2⟩

Share

Metrics

Record views

386

Files downloads

955