[Resource Topic] 2012/281: Publicly Verifiable Delegation of Large Polynomials and Matrix Computations, with Applications

Welcome to the resource topic for 2012/281

Title:
Publicly Verifiable Delegation of Large Polynomials and Matrix Computations, with Applications

Authors: Dario Fiore, Rosario Gennaro

Abstract:

Outsourced computations (where a client requests a server to perform some computation on its behalf) are becoming increasingly important due to the rise of Cloud Computing and the proliferation of mobile devices. Since cloud providers may not be trusted, a crucial problem is the verification of the integrity and correctness of such computation, possibly in a {\em public} way, i.e., the result of a computation can be verified by any third party, and requires no secret key – akin to a digital signature on a message. We present new protocols for publicly verifiable secure outsourcing of {\em Evaluation of High Degree Polynomials} and {\em Matrix Multiplication}. Compared to previously proposed solutions, ours improve in efficiency and offer security in a stronger model. The paper also discusses several practical applications of our protocols.

ePrint: https://eprint.iacr.org/2012/281

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .