Abstract
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). MSC 2010 classification. 94A60 Cryptography
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
