Oblivious evaluation of multivariate polynomials

Tamir Tassa, Ayman Jarrous, Yonatan Ben-Ya'akov

Research output: Contribution to journalArticlepeer-review


One of the fundamental problems of multi-party computation is Oblivious Polynomial Evaluation. In that problem, that was introduced by Naor and Pinkas, Alice has a polynomial P.x/ and Bob has a point -. The goal is to allow Bob to compute P.α/ so that Alice remains oblivious of α and Bob of P.x/, apart from what is implied by P. α/and α. We introduce the multivariate version of this problem, where x and α are vectors, and offer an efficient secure protocol. In addition, we discuss several applications that may be solved efficiently using oblivious multivariate polynomial evaluation, such as private linear algebraic computations and private support vector machines (SVM).

Original languageEnglish
Pages (from-to)1-29
Number of pages29
JournalJournal of Mathematical Cryptology
Issue number1
StatePublished - Jul 2013


  • Cryptography
  • Multivariate polynomials
  • Oblivious transfer
  • Privacy
  • Secure function evaluation
  • Secure two-party computation


Dive into the research topics of 'Oblivious evaluation of multivariate polynomials'. Together they form a unique fingerprint.

Cite this