Efficient secure computation optimization

Abstract

Secure computation has high computational resource requirements during run-time. Secure computation optimization can lower these requirements, but has high computational resource requirements during compile-time. This prevents automatic optimization of most larger secure computations. In this paper we present an efficient optimization algorithm that does no longer require the use of a theorem prover. For a secure computation with m statements of which n are branching statements we lower the complexity from O(2^(2^n) m) to O(m^5 2^n). Using an implementation of our algorithm we can extend automatic optimization to further examples such as the AES key schedule.