Challenges in compiler construction for secure two-party computation

  • Authors:
  • Andreas Holzer;Nikolaos P. Karvelas;Stefan Katzenbeisser;Helmut Veith;Martin Franz

  • Affiliations:
  • Vienna University of Technology, Vienna, Austria;CASED & TU Darmstadt, Darmstadt, Germany;CASED & TU Darmstadt, Darmstadt, Germany;Vienna University of Technology, Vienna, Austria;CrypTool, Frankfurt, Germany

  • Venue:
  • Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of secure two-party computation has received great attention in the years that followed its introduction by Yao. The solutions proposed follow one of the two research directions of either using homomorphic encryption techniques or implementing Yao's "Garbled Circuit" solution. The latter requires circuits to implement a given functionality. Recently, the compiler CBMC-GC was introduced, the first compiler capable of translating programs written in a general purpose language (ANSI-C) into circuits suitable for secure two-party computation. In this paper, we discuss the current limitations of CBMC-GC and propose directions for future research.