关键词:
secure multiparty computation
private function evaluation
bi-input PFE
public-key encryption
symmetric-key encryption
摘要:
In the past, researchers have discussed the problem of two-party single-input private function evaluation (PFE), where P-1 holds a private input x while P-2 holds a private circuit C-f, and their goal is to securely compute C-f(x) without revealing x and C-f. Herein, we further consider a more general case, two-party bi-input PFE, where P-2 also participates in the PFE by contributing a private input y. The research in this general case is of great value not only in theory but also in practice. In this paper, we focus on this problem and propose the first constant-round two-party bi-input PFE protocol, which is with linear complexity and without relying on universal circuit or fully homomorphic encryption. Copyright (c) 2015 John Wiley & Sons, Ltd.