Cryptology ePrint Archive: Report 2012/281

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

Dario Fiore and 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.

Category / Keywords: cryptographic protocols / verifiable computation, PRF

Publication Info: This is the full version of the paper that appears in the proceedings of ACM CCS 2012

Date: received 17 May 2012, last revised 23 Jul 2012

Contact author: fiore at cs nyu edu

Available format(s): PDF | BibTeX Citation

Version: 20120723:144448 (All versions of this report)

Short URL: ia.cr/2012/281