Oblivious evaluation of multivariate polynomials

Journal of Mathematical Cryptology

卷:7

Jarrous Ayman¹  Ben-Ya'akov Yonatan²  Tassa Tamir³ 

[1] Department of Computer Science, Haifa University, Israel;

[2] Department of Mathematics and Computer Science,The Open University, Ra'anana, Israel;

[3] Department of Mathematics and Computer Science, The Open University, Ra'anana, Israel;

关键词: cryptography;    privacy;    secure two-party computation;    secure function evaluation;    oblivious transfer;    multivariate polynomials;   

DOI  :  10.1515/jmc-2012-0007

来源: DOAJ

【 摘 要 】

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

【 授权许可】

Unknown