2016
DOI: 10.1007/978-3-319-41483-6_20
|View full text |Cite
|
Sign up to set email alerts
|

CheapSMC: A Framework to Minimize Secure Multiparty Computation Cost in the Cloud

Abstract: Secure multi-party computation (SMC) techniques are increasingly becoming more efficient and practical thanks to many recent novel improvements. The recent work have shown that different protocols that are implemented using different sharing mechanisms (e.g., boolean, arithmetic sharings, etc.) may have different computational and communication costs. Although there are some works that automatically mix protocols of different sharing schemes to fasten execution, none of them provide a generic optimization fram… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
17
1

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(18 citation statements)
references
References 20 publications
0
17
1
Order By: Relevance
“…The computation and communication costs of a hybrid MPC protocol depend on the combined costs to evaluate each module in the selected protocol plus the time to convert between modules, when evaluating them with different protocols. However, in contrast to previous works, i.e., [32] and [44], we observe that the optimization problem, i.e., achieving minimal costs for a given decomposition, is not only a protocol selection problem but also a scheduling problem. Namely, the evaluation order of parallel modules, i.e., modules without sequential dependencies, can significantly influence the effectiveness of protocol selection, and thus the overall protocol runtime.…”
Section: Problem Definitioncontrasting
confidence: 79%
See 3 more Smart Citations
“…The computation and communication costs of a hybrid MPC protocol depend on the combined costs to evaluate each module in the selected protocol plus the time to convert between modules, when evaluating them with different protocols. However, in contrast to previous works, i.e., [32] and [44], we observe that the optimization problem, i.e., achieving minimal costs for a given decomposition, is not only a protocol selection problem but also a scheduling problem. Namely, the evaluation order of parallel modules, i.e., modules without sequential dependencies, can significantly influence the effectiveness of protocol selection, and thus the overall protocol runtime.…”
Section: Problem Definitioncontrasting
confidence: 79%
“…A very interesting use case is the optimization of the protocol's online runtime, yet, various other cost models are also of interest. For example optimizing the cloud computing costs, i.e., the price to pay for computational power and traffic to perform a computation using cloud service providers, has been discussed in [44]. Further examples are the total protocol runtime including or excluding the time spent on preprocessing depending on the use case of the application, the pure communication costs when considering a constrained network connection, or the power consumption when considering mobile devices.…”
Section: Problem Definitionmentioning
confidence: 99%
See 2 more Smart Citations
“…While we agree that there are indeed some privacy (and security) risks in fog computing, we believe that these are largely technical challenges that can be surmounted with existing technology. On the other hand, fog computing provides invaluable privacy opportunities that are primarily of structural nature and can valuably complement existing, especially cryptographic techniques such as homomorphic encryption [7], secure multi-party computation [9], or mechanisms for differential privacy [10]. These structure-based opportunities can be used to significantly heighten data privacy, as compared to well-established cloud-centric models of data processing.…”
Section: Introductionmentioning
confidence: 99%