Paper 2014/200

Automatic Protocol Selection in Secure Two-Party Computations

Florian Kerschbaum, 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Major revision.Applied Cryptography and Network Security (ACNS), 2014
DOI
10.1007/978-3-319-07536-5_33
Keywords
Secure Two-Party ComputationPerformanceOptimizationProtocol Selection
Contact author(s)
thomas schneider @ ec-spride de
History
2014-06-13: revised
2014-03-17: received
See all versions
Short URL
https://ia.cr/2014/200
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/200,
      author = {Florian Kerschbaum and Thomas Schneider and Axel Schröpfer},
      title = {Automatic Protocol Selection in Secure Two-Party Computations},
      howpublished = {Cryptology ePrint Archive, Paper 2014/200},
      year = {2014},
      doi = {10.1007/978-3-319-07536-5_33},
      note = {\url{https://eprint.iacr.org/2014/200}},
      url = {https://eprint.iacr.org/2014/200}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.