The Community for Technology Leaders
2011 IEEE 35th Annual Computer Software and Applications Conference (2011)
Munich, Germany
July 18, 2011 to July 22, 2011
ISSN: 0730-3157
ISBN: 978-0-7695-4439-7
pp: 298-307
Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several general protocols for SC have been proposed and recently been implemented in a number of compilers and frameworks. These compilers or frameworks implement one general SC protocol and then require the programmer to implement the function he wants the protocol to compute. Performance remains a challenge for this approach and it has been realized early on that special protocols for important problems can deliver superior performance. In this paper we propose a new intermediate language (L1) for optimizing SC compilers which enables efficient implementation of special protocols potentially mixing several general SC protocols. We show by three case studies -- one for computation of the median, one for weighted average, one for division -- that special protocols and mixed-protocol implementations in our language L1 can lead to superior performance. Moreover, we show that only a combined view on algorithm \emph{and} cryptographic protocol can discover SCs with best run-time performance.
Multi-party Computation, Compiler

F. Kerschbaum, G. Müller and A. Schröpfer, "L1 - An Intermediate Language for Mixed-Protocol Secure Computation," 2011 IEEE 35th Annual Computer Software and Applications Conference(COMPSAC), Munich, Germany, 2011, pp. 298-307.
93 ms
(Ver 3.3 (11022016))