Verifying Computations without Reexecuting Them

11^th January 2018, 14:00
Alexei Listsa

Abstract

I will introduce and overview the area of *verifiable computing* which addresses the verification of
the results of computations after they have been done, perhaps by something/somebody we don't fully trust (e.g. remote, and/or corrupted servers).
For general introduction I will follow largely to [1] , while a bit more technical details will be given for a particular system Pinocchio [2].

References
---------------,

1.) Verifying Computations without Reexecuting Them, By Michael Walfish, Andrew J. Blumberg
Communications of the ACM, Vol. 58 No. 2, Pages 74-84 10.1145/2641562
https://cacm.acm.org/magazines/2015/2/182636-verifying-computations-without-reexecuting-them/fulltext

2.) Pinocchio: Nearly Practical Verifiable Computation, By Bryan Parno, Jon Howell, Craig Gentry, Mariana Raykova
Communications of the ACM, Vol. 59 No. 2, Pages 103-112 10.1145/2856449
https://cacm.acm.org/magazines/2016/2/197429-pinocchio/fulltext

Additional Materials

• https://cacm.acm.org/magazines/2015/2/182636-verifying-computations-without-reexecuting-them/fulltext