Abstract
We define a problem of certifying computation integrity performed by some remote party we do not necessarily trust. We present a multi-party interactive protocol called SafeComp that solves this problem under specified constraints. Comparing to the nearest related work, our protocol reduces a proof construction complexity from O(n logn) to O(n), turning a communication complexity to exactly one round using a certificate of a comparable length.