%0 Conference Proceedings
%T CheapSMC: A Framework to Minimize Secure Multiparty Computation Cost in the Cloud
%+ University of Texas at Dallas [Richardson] (UT Dallas)
%+ Vanderbilt University School of Engineering [Nashville] (VUSE)
%A Pattuk, Erman
%A Kantarcioglu, Murat
%A Ulusoy, Huseyin
%A Malin, Bradley
%Z Part 6: Reasoning about Security and its Cost
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 30th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec)
%C Trento, Italy
%Y Silvio Ranise
%Y Vipin Swarup
%I Springer International Publishing
%3 Data and Applications Security and Privacy XXX
%V LNCS-9766
%P 285-294
%8 2016-07-18
%D 2016
%R 10.1007/978-3-319-41483-6_20
%Z Computer Science [cs]Conference papers
%X Secure multi-party computation (SMC) techniques are increasingly more efficient and practical, due in part, to various improvements. For instance, recent research has shown that different protocols that are implemented using different sharing mechanisms (e.g., boolean and arithmetic sharings) can have varying computational and communication costs. Although there are some approaches to automatically mix protocols of different sharing schemes to enhance execution efficiency, none provide a generic optimization framework to discover the least expensive mixed-protocol SMC execution for cloud deployment.In this work, we introduce a generic SMC optimization framework CheapSMC that can invoke any mixed-protocol SMC circuit evaluation tool as a black box to uncover the cheapest SMC cloud deployment option. To do so, CheapSMC computes one-time benchmarks for the target cloud service and gathers performance statistics for basic circuit components. Relying on these statistics, an optimization layer of CheapSMC invokes several heuristics to find the cheapest mix-protocol circuit evaluation. Subsequently, the optimized circuit is passed to a mixed-protocol SMC tool for actual executable generation. Our empirical results, gathered by running cases studies on large range of complexity in data volume and functions for computation, show that significant cost savings can be achieved via our optimization framework in comparison to the state-of-the-art.
%G English
%Z TC 11
%Z WG 11.3
%2 https://inria.hal.science/hal-01633669/document
%2 https://inria.hal.science/hal-01633669/file/428203_1_En_20_Chapter.pdf
%L hal-01633669
%U https://inria.hal.science/hal-01633669
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-WG11-3
%~ IFIP-DBSEC
%~ IFIP-LNCS-9766