Maturity and Performance of Programmable Secure Computation

David W.  Archer; Dan Bogdanov; Benny Pinkas; Pille Pullonen

Paper 2015/1039

Maturity and Performance of Programmable Secure Computation

David W. Archer, Dan Bogdanov, Benny Pinkas, and Pille Pullonen

Abstract

Secure computation research has gained traction internationally in the last five years. In the United States, the DARPA PROCEED program (2011-2015) focused on development of multiple SC paradigms and improving their performance. In the European Union, the PRACTICE program (2013-2016) focuses on its use to secure cloud computing. Both programs have demonstrated exceptional prototypes and performance improvements. In this paper, we collect the results from both programs and other published literature to present the state of the art in what can be achieved with today's secure computing technology. We consider linear secret sharing based computations, garbled circuits and fully homomorphic encryption. We describe theoretical and practical criteria that can be used to characterize secure computation paradigms and provide an overview of common benchmarks such as AES evaluation.

Note: Some clarifications and additional references.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Major revision. IEEE Security & Privacy
DOI: 10.1109/MSP.2016.97
Keywords: secure computation
Contact author(s): pille pullonen @ cyber ee
History: 2016-10-27: last of 2 revisions; 2015-10-28: received; See all versions
Short URL: https://ia.cr/2015/1039
License: CC BY

BibTeX

@misc{cryptoeprint:2015/1039,
      author = {David W.  Archer and Dan Bogdanov and Benny Pinkas and Pille Pullonen},
      title = {Maturity and Performance of Programmable Secure Computation},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/1039},
      year = {2015},
      doi = {10.1109/MSP.2016.97},
      url = {https://eprint.iacr.org/2015/1039}
}