Content deleted Content added
Tags: Reverted Mobile edit Mobile web edit |
HMSLavender (talk | contribs) m Reverted edits by 2400:9800:520:DC2F:1:0:4235:A6D6 (talk) (AV) |
||
Line 96:
Many advances have been made on 2PC and MPC systems in recent years.
=== Yao-
One of the main issues when working with Yao-based protocols is that the function to be securely evaluated (which could be an arbitrary program) must be represented as a circuit, usually consisting of XOR and AND gates. Since most real-world programs contain loops and complex data structures, this is a highly non-trivial task. The Fairplay system<ref name="Fairplay">A. Ben-David, N. Nisan and B. Pinkas, "FairplayMP: a system for secure multi-party computation," ACM CCS 2008, pp. 257–266, 2008.</ref> was the first tool designed to tackle this problem. Fairplay comprises two main components. The first of these is a compiler enabling users to write programs in a simple high-level language, and output these programs in a Boolean circuit representation. The second component can then garble the circuit and execute a protocol to securely evaluate the garbled circuit. As well as two-party computation based on Yao's protocol, Fairplay can also carry out multi-party protocols. This is done using the BMR protocol,<ref name="Fairplay" /> which extends Yao's passively secure protocol to the active case.
| |||