Highly Efficient and Re-executable Private Function Evaluation with Linear Complexity
Osman Biçer, Muhammed Ali Bingöl, Mehmet Sabır Kiraz, Albert William Levi · IEEE Transactions on Dependable and Secure Computing · 2020
Private function evaluation aims to securely compute a function$f(x_1, \ldots, x_n)$without leaking any information other than what is revealed by the output, where$f$is a private input of one of the parties (say$\mathsf {Party}_1$) and$x_i$is a private input of the$i$th party$\mathsf {Party}_i$. In this article, we propose a novel and securetwo-party private function evaluation(2PFE) scheme based on the DDH assumption. Our scheme introduces a reusability feature that significantly improves the state-of-the-art. Accordingly, our scheme has two variants, one is utilized in the initial execution of the function$f$, and the other is utilized in its subsequent evaluations. To the best of our knowledge, this is the first and most efficient 2PFE scheme that enjoys a reusablity feature. Our protocols achieve linear communication and computation complexities and a constant number of rounds which is at most three.