A Practical Universal Circuit Construction and Secure Evaluation of Private Functions

  • Vladimir Kolesnikov
  • Thomas Schneider
Conference paper

DOI: 10.1007/978-3-540-85230-8_7

Volume 5143 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Kolesnikov V., Schneider T. (2008) A Practical Universal Circuit Construction and Secure Evaluation of Private Functions. In: Tsudik G. (eds) Financial Cryptography and Data Security. FC 2008. Lecture Notes in Computer Science, vol 5143. Springer, Berlin, Heidelberg

Abstract

We consider general secure function evaluation (SFE) of private functions (PF-SFE). Recall, privacy of functions is often most efficiently achieved by general SFE [18,19,10] of a Universal Circuit (UC).

Our main contribution is a new simple and efficient UC construction. Our circuit UCk, universal for circuits of k gates, has size ~1.5 k log2k and depth ~k logk. It is up to 50% smaller than the best UC (of Valiant [16], of size ~19klogk) for circuits of size up to ≈ 5000 gates.

Our improvement results in corresponding performance improvement of SFE of (small) private functions. Since, due to cost, only small circuits (i.e. < 5000 gates) are practical for PF-SFE, our construction appears to be the best fit for many practical PF-SFE.

We implement PF-SFE based on our UC and Fairplay SFE system [11].

Keywords

SFE of private functions universal circuit privacy 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Vladimir Kolesnikov
    • 1
  • Thomas Schneider
    • 2
  1. 1.Bell Laboratories USA
  2. 2.Dept. of Comp. Sci.University of Erlangen-NurembergGermany