Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

By Yehuda Lindell, Benny Pinkas, Nigel P. Smart. 2008

139 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol (2012, background): “In the last few years a number of MPC “systems” have appeared [4, 7–9, 12, 15, 22], as well as experimental research results [13, 16, 21, 25, 26].”
Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution (2012, background): “I. INTRODUCTION Protocols for secure two-party computation allow two mutually distrusting parties to compute a function that depends on both their inputs while ensuring correctness, privacy, and more, without relying on a trusted third party.”
Privacy-preserving matrix factorization (2013, background): “There are presently many frameworks that implement Yao garbled circuits [45, 23, 24, 44, 53, 25, 36].”
Fast Garbling of Circuits Under Standard Assumptions (2015, methodology): “• Number of encryptions [19]: Classically, each entry in a garbled gate contains the encryption of one of the output garbled values under two input garbled values and thus requires two encryptions .”
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols (2010, background): “Examples include voting schemes [3], biometric authentication [4], group signatures [5], interactive verifiable computation [6], e-cash [7], and secure multiparty computation [8].”
Faster Secure Two-Party Computation in the Single-Execution Setting (2017, background): “Since the first implementation of a 2PC protocol with malicious security [27], many implementations with better performance (including those already discussed in the introduction) have been developed [32,31,23,35,11,13].”
Faster Secure Two-Party Computation Using Garbled Circuits (2011, background): “Beginning with Fairplay [22], several implementations of generic secure two-party computation have been developed in the past few years [11, 21, 27] and used to build privacy-preserving protocols for various functions (e.g., [4,13,16,26,29]).”
FairplayMP: a system for secure multi-party computation (2008, background): “Recent work [15], describes a highly optimized implementation of a two-party protocol secure against malicious adversaries based on a recent efficient construction of Lindell and Pinkas [14], but protocols with similar efficiency do not currently exist for the multi-party case.”
A New Approach to Practical Active-Secure Two-Party Computation (2012, methodology): “…practical overhead of secure computation, and several works have perfected and implemented protocols based on Yao gar-bled circuits [MNPS04,BDNP08,LPS08,KS08,PSSW09,HKS + 10,MK10,LP11,SS11, A brief comparison of the time needed for oblivious AES evaluation for the best known implementations are…”
Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates (2015, methodology): “The ﬁrst implementation of secure two-party computation (2PC) [26] used Yao’s basic garbled circuit approach, and it remains the primary (but not only) paradigm for the many 2PC implementations that have been developed over the past ten years [25, 28, 10, 14, 21, 12].”
Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? (2012, background): “, [31,36]) have explored extensions to the malicious setting.”
Secure Two-Party Computation is Practical (2009, methodology): “The basic implementation choice of the underlying encryption scheme to be used is the same as the implementation described in [22].”
Efficient Garbling from a Fixed-Key Blockcipher (2013, methodology): “Pinkas, Schneider, Smart, and Williams (PSSW) [37] implement both instantiations; their garbling schemes are variants of Ga/GaX/GaXR, where each DKC's tweak is a nonce instead of the gate index.”