Efficient techniques for publicly verifiable delegation of computation

Elkhiyaoui, Kaoutar; Önen, Melek; Azraoui, Monir; Molva, Refik
Research Report RR-14-295

With the advent of cloud computing, individuals and companies alike are looking for opportunities to leverage cloud resources not only for storage but also for computation. Nevertheless, the reliance on the cloud to performcomputation raises the unavoidable challenge of how to assure the correctness of the delegated computation. In this regard, we introduce two cryptographic protocols for publicly verifiable computation that allow a lightweight client to securely outsource to a cloud server the evaluation of high degree univariate polynomials and the multiplication of large matrices. Similarly to existing work, our protocols follow the amortized verifiable computation approach. However, instead of using algebraic pseudo-random functions, we exploit the mathematical properties of polynomials and matrices to propose more efficient and more viable solutions. Besides their efficiency, our protocols are provably secure under standard assumptions.

Sécurité numérique
Eurecom Ref:
© EURECOM. Personal use of this material is permitted. The definitive version of this paper was published in Research Report RR-14-295 and is available at :

PERMALINK : https://www.eurecom.fr/publication/4388