Abstract

AbstractIn the past, researchers have discussed the problem of two‐party single‐input private function evaluation (PFE), where P1 holds a private input x while P2 holds a private circuit Cf, and their goal is to securely compute Cf(x) without revealing x and Cf. Herein, we further consider a more general case, two‐party bi‐input PFE, where P2 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 © 2015 John Wiley & Sons, Ltd.

Full Text
Published version (Free)

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 call