Constant-Round Private Function Evaluation with Linear Complexity

  • Jonathan Katz
  • Lior Malka
Conference paper

DOI: 10.1007/978-3-642-25385-0_30

Volume 7073 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Katz J., Malka L. (2011) Constant-Round Private Function Evaluation with Linear Complexity. In: Lee D.H., Wang X. (eds) Advances in Cryptology – ASIACRYPT 2011. ASIACRYPT 2011. Lecture Notes in Computer Science, vol 7073. Springer, Berlin, Heidelberg


We consider the problem of private function evaluation (PFE) in the two-party setting. Here, informally, one party holds an input x while the other holds a (circuit describing a) function f; the goal is for one (or both) of the parties to learn f(x) while revealing nothing more to either party. In contrast to the usual setting of secure computation, where the function being computed is known to both parties, PFE is useful in settings where the function (i.e., algorithm) itself must remain secret, e.g., because it is proprietary or classified.

It is known that PFE can be reduced to standard secure computation by having the parties evaluate a universal circuit, and this is the approach taken in most prior work. Using a universal circuit, however, introduces additional overhead and results in a more complex implementation. We show here a completely new technique for PFE that avoids universal circuits, and results in constant-round protocols with communication/computational complexity linear in the size of the circuit computing f. This gives the first constant-round protocol for PFE with linear complexity (without using fully homomorphic encryption), even restricted to semi-honest adversaries.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Jonathan Katz
    • 1
  • Lior Malka
    • 2
  1. 1.Dept. of Computer ScienceUniversity of MarylandUSA
  2. 2.IntelUSA