Oblivious polynomial evaluation protocol is one of the fundamental protocols in secure multi-party computation domain. The existing oblivious polynomial evaluation protocol, only handling the univariate polynomial eva...
详细信息
Oblivious polynomial evaluation protocol is one of the fundamental protocols in secure multi-party computation domain. The existing oblivious polynomial evaluation protocol, only handling the univariate polynomial evaluation problems, is not enough to meet the demands in practice. In this paper, we propose a multivariate oblivious polynomial evaluation protocol depending on secure two-party scalar product protocol and homomorphic encryption scheme. To the best of our knowledge, this protocol is the first one to cope with both the univariate and multivariate oblivious polynomial evaluation problems. When we use our protocol and the existing one to solve the univariate oblivious polynomial evaluation problem, the performance analysis shows that at a same security level, the communication and computational overheads of our protocol are approximate O(1/ √|N| log |N|) times of those of the existing protocol, where |N| is the number of bits of the modulus N of the public key encryption schemes used in the two protocols.
暂无评论