An Optimizing Compiler for Secure Computations

Florian Kerschbaum


Secure multi-party computations have many applications in privacy and data security. They can solve cross-organizational problems in supply chain management or privacy-enhanced data analysis, such that the protection needs of the parties are respected. Nevertheless, the development of protocols for multi-party computation is extremely complex. Domain-specific languages can help the programmer to implement more efficiently and effectively. However, compilers currently produce worse results than manually generated protocols. Program analysis and automated optimization can remedy this problem. Based on several practical examples we show general techniques for optimizing secure computations which can be automatically implemented in a compiler.

Time and Place

Thursday, February 21, 2013, 4:30pm
Gates 415 (note unusual place)