English

Private Outsourcing of Polynomial Evaluation and Matrix Multiplication using Multilinear Maps

Cryptography and Security 2013-09-04 v3

Abstract

{\em Verifiable computation} (VC) allows a computationally weak client to outsource the evaluation of a function on many inputs to a powerful but untrusted server. The client invests a large amount of off-line computation and gives an encoding of its function to the server. The server returns both an evaluation of the function on the client's input and a proof such that the client can verify the evaluation using substantially less effort than doing the evaluation on its own. We consider how to privately outsource computations using {\em privacy preserving} VC schemes whose executions reveal no information on the client's input or function to the server. We construct VC schemes with {\em input privacy} for univariate polynomial evaluation and matrix multiplication and then extend them such that the {\em function privacy} is also achieved. Our tool is the recently developed {mutilinear maps}. The proposed VC schemes can be used in outsourcing {private information retrieval (PIR)}.

Keywords

Cite

@article{arxiv.1308.4218,
  title  = {Private Outsourcing of Polynomial Evaluation and Matrix Multiplication using Multilinear Maps},
  author = {Liang Feng Zhang and Rehanehi Safavi-Naini},
  journal= {arXiv preprint arXiv:1308.4218},
  year   = {2013}
}

Comments

23 pages, A preliminary version appears in the 12th International Conference on Cryptology and Network Security (CANS 2013)

R2 v1 2026-06-22T01:11:57.124Z