Cryptology ePrint Archive: Report 2014/200

Automatic Protocol Selection in Secure Two-Party Computations

Florian Kerschbaum and Thomas Schneider and Axel Schröpfer

Abstract: Performance of secure computation is still often an obstacle to its practical adaption. There are different protocols for secure computation that compete for the best performance. In this paper we propose automatic protocol selection which selects a protocol for each operation resulting in a mix with the best performance so far. Based on an elaborate performance model, we propose an optimization algorithm and an efficient heuristic for this selection problem. We show that our mixed protocols achieve the best performance on a set of use cases. Furthermore, our results underpin that the selection problem is so complicated and large in size, that a programmer is unlikely to manually make the optimal selection. Our proposed algorithms nevertheless can be integrated into a compiler in order to yield the best (or near-optimal) performance.

Category / Keywords: cryptographic protocols / Secure Two-Party Computation, Performance, Optimization, Protocol Selection

Original Publication (with major differences): Applied Cryptography and Network Security (ACNS), 2014
DOI:
10.1007/978-3-319-07536-5_33

Date: received 17 Mar 2014, last revised 13 Jun 2014

Contact author: thomas schneider at ec-spride de

Available format(s): PDF | BibTeX Citation

Version: 20140613:144216 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]