Secure Two-party Newton Interpolation

Secure two-party Newton interpolation refers to a process that two parties privately compute a polynomial over their coordinate pairs using Newton interpolation method. However, current solutions such as fully homomorphic encryption or garbled circuit remain inefficient. In this paper, we propose a specific solution to this problem based on oblivious polynomial evaluation. To improve the efficiency, we separate the coefficient construction phase and the observation value computing phase. By this means, the communication cost of computing one observation value is reduced to a constant level. And through comparison to solutions based on other interpolation method, we prove that our solution performs well in computing multiple values of the polynomial.