Automated Synthesis of Optimized Circuits for Secure Computation
Open Access
- 12 October 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1504-1517
Abstract
In the recent years, secure computation has been the subject of intensive research, emerging from theory to practice. In order to make secure computation usable by non-experts, Fairplay (USENIX Security 2004) initiated a line of research in compilers that allow to automatically generate circuits from high-level descriptions of the functionality that is to be computed securely. Most recently, TinyGarble (IEEE S&P 2015) demonstrated that it is natural to use existing hardware synthesis tools for this task. In this work, we present how to use industrial-grade hardware synthesis tools to generate circuits that are not only optimized for size, but also for depth. These are required for secure computation protocols with non-constant round complexity. We compare a large variety of circuits generated by our toolchain with hand-optimized circuits and show reduction of depth by up to 14%. The main advantages of our approach are developing customized libraries of depth-optimized circuit constructions which we map to high-level functions and operators, and using existing libraries available in the industrial-grade logic synthesis tools which are heavily tested. In particular, we show how to easily obtain circuits for IEEE 754 compliant floating-point operations. We extend the open-source ABY framework (NDSS 2015) to securely evaluate circuits generated with our toolchain and show between 0.5 to 21.4 times faster floating-point operations than previous protocols of Aliasgari et al. (NDSS 2013), even though our protocols work for two parties instead of three or more. As application we consider privacy-preserving proximity testing on Earth.Keywords
Funding Information
- German Federal Ministry of Education and Research (BMBF) (CRC 1119 CROSSING)
- European Union's 7th Framework Program (609611/PRACTICE)
This publication has 30 references indexed in Scilit:
- Efficient Garbling from a Fixed-Key Blockcipher2013
- More efficient oblivious transfer and extensions for faster secure computation2013
- Secure two-party computations in ANSI C2012
- High-performance secure multi-party computation for data mining applicationsInternational Journal of Information Security, 2012
- Processing encrypted floating point signals2011
- FairplayMP2008
- Improved Garbled Circuit: Free XOR Gates and Applications2008
- On the multiplicative complexity of Boolean functions over the basis (∧,⊕,1)Theoretical Computer Science, 2000
- Static scheduling algorithms for allocating directed task graphs to multiprocessorsACM Computing Surveys, 1999
- How to play ANY mental game1987