Compilation for Secure Two-Party Computations
نویسندگان
چکیده
Secure two-party computation (STC) is a computer security paradigm that enables two distrusting parties to jointly compute on sensitive input data. While both parties are interested in the outcome of the computation, they are not willing to share their data with each other. Until recently, STC was deemed theoretical and impractical. However, novel efficient cryptographic primitives bring STC well within practical reach. Indeed, custom-tailored commercial STC products already appeared on the market. Unfortunately, a widespread application of STC is still hindered by the difficulty to implement STC protocols. While recent work proposed simple programming languages for the specification of STCs, they are still difficult to use for practitioners, and translating existing source code into this format is cumbersome. Similarly, the manual construction of STC protocols is labor intensive and error-prone. We discuss recent work that forms a significant step towards practically realizable STCs that can be integrated into modern software engineering frameworks. In particular, we discuss the compiler CBMC-GC which uses model checking techniques to automatically generate efficient STC protocols from ANSI C programs. Experimental results demonstrate CBMC-GC’s practical usefulness.
منابع مشابه
The Impossibility Of Secure Two-Party Classical Computation
Consider two parties wishing to compute some joint function of their data (two millionaires might wish to know who is richer, for example). A secure computation of such a function is one for which the only information the first party gets on the input of the second is that implied by the outcome of the computation, and vice versa. In this work, we focus on unconditional security, whereby we see...
متن کاملEfficient Maliciously Secure Two Party Computation for Mixed Programs
We propose a new approach for practical secure two-party computation (2PC) achieving security in the presence of malicious adversaries. Given a program to compute, the idea is to identify subcomputations that depend on only one or neither of the parties’ private inputs. Such computations can be secured at significantly lower cost, using different protocol paradigms for each case. We then show h...
متن کاملRevisiting the Efficiency of Malicious Two-Party Computation
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this problem, such as zero-knowledge compilation, more efficient. The authors provide several schemes which are the most efficient to date. We propose a modification to their main scheme using expanders. Our modification ...
متن کاملFair Two-Party Computations via Bitcoin Deposits
We show how the Bitcoin currency system (with a small modification) can be used to obtain fairness in any two-party secure computation protocol in the following sense: if one party aborts the protocol after learning the output then the other party gets a financial compensation (in bitcoins). One possible application of such protocols is the fair contract signing: each party is forced to complet...
متن کاملSecure Multi-party Computation Protocols from a High-Level Programming Language
Secure multi-party computation (SMC) enables privacy-preserving computations on data originating from a number of parties. In today’s digital world, data privacy is increasingly more difficult to provide. With SMC methods like secret sharing and Yao’s garbled circuits, it is possible to build privacypreserving computational protocols that do not leak confidential inputs to other parties. The ad...
متن کامل