Automatically optimizing secure computation

On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, optimized protocols with high performance for special problems demand manual development and security verification. The question considered in this paper is: Can we construct a compiler that produces optimized protocols? We present an optimization technique based on logic inference about what is known from input and output. Using the example of median computation we can show that our program analysis and rewriting technique translates a FairPlay program into an equivalent – in functionality and security – program that corresponds to the protocol by Aggarwal et al. Nevertheless our technique is general and can be applied to optimize a wide variety of secure computation protocols. Categories and Subject Descriptors D.3.4 [Programming Languages]: Processors—Optimization; D.4.6 [Operating Systems]: Securit...

• Type: Journal
• Year: 2011
• Where: CCS
• Authors: Florian Kerschbaum
• Keywords: CCS 2011, Logic Inference, Programming Languages Processors, Programming Optimization, Security Privacy