Paper 2015/190

Multi-Client Non-Interactive Verifiable Computation

Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, and Carlos Cid


Gennaro et al.\ (Crypto 2010) introduced the notion of \emph{non-interactive verifiable computation}, which allows a computationally weak client to outsource the computation of a function $f$ on a series of inputs $x^{(1)}, \ldots$ to a more powerful but untrusted server. Following a pre-processing phase (that is carried out only once), the client sends some representation of its current input $x^{(i)}$ to the server; the server returns an answer that allows the client to recover the correct result $f(x^{(i)})$, accompanied by a proof of correctness that ensures the client does not accept an incorrect result. The crucial property is that the work done by the client in preparing its input and verifying the server's proof is less than the time required for the client to compute~$f$ on its own. We extend this notion to the \emph{multi-client} setting, where $n$ computationally weak clients wish to outsource to an untrusted server the computation of a function $f$ over a series of {\em joint} inputs $(x_1^{(1)}, \ldots, x_{\clients}^{(1)}), \ldots$ without interacting with each other. We present a construction for this setting by combining the scheme of Gennaro et al.\ with a primitive called proxy oblivious transfer.

Available format(s)
Publication info
Published by the IACR in TCC 2013
verifiable computation
Contact author(s)
vranjit @ mit edu
2015-03-04: received
Short URL
Creative Commons Attribution


      author = {Seung Geol Choi and Jonathan Katz and Ranjit Kumaresan and Carlos Cid},
      title = {Multi-Client Non-Interactive Verifiable Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2015/190},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.