Verifiable Computations with RAM-like Running Times

TL;DR

This paper introduces a verifiable computation method that offers RAM-like running times and low input verification costs, suitable for resource-constrained devices in IoT and edge computing environments.

Contribution

It presents a novel verifiable computation scheme with RAM-like efficiency and minimal input verification costs, addressing challenges in IoT and edge computing.

Findings

Achieves RAM-like running times for verifiable computations.

Ensures low input preparation and verification costs.

Suitable for resource-constrained devices in IoT environments.

Abstract

Current and emerging trends such as cloud computing, fog computing, and more recently, multi-access edge computing (MEC) increase the interest in finding solutions to the verifiable computation problem. Furthermore, the number of computationally weak devices have increased drastically in recent years due to the ongoing realization of the Internet of Things. This work proposes a solution which enjoys the following two desirable properties: (1) cost of input preparation and verification is very low (low enough to allow verifiable outsourcing of computations by resource-constrained devices on constrained networks); (2) the running time of the verifiable computation is RAM-like.