Efficiency Tradeoffs for Malicious Two-Party Computation

By Payman Mohassel, M. Franklin. 2006

162 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

Privacy-Preserving Distributed Linear Regression on High-Dimensional Data (2017, background): “This selective failure attack has been discussed thoroughly in the context of garbled circuits [38, 53].”
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records (2013, methodology): “Building on earlier work [33], a recent two-party system by Huang et al. [30] provides security against malicious adversaries by running the protocol twice on both parties and comparing the result using a secure equality test.”
Efficient Secure Computation with Garbled Circuits (2011, methodology): “Mohassel and Franklin [42] proposed the equality-checker scheme, which needs O(ns2) commitments to be computed and exchanged to ensure the generator’s input consistency, where n is the input size and s is a statistical security parameter that is the number of copies of the garbled circuit.”
Billion-Gate Secure Computation with Malicious Adversaries (2012, background): “In addition to these original ideas, practical concerns involving large circuits and parallelization will be addressed.”
Foundations of garbled circuits (2012, background): “5 for an example—consists of an Φ circ none NPS99 [46] privacy-preserving auctions prv Φ circ proxy OT KO04 [34] 2-party SFE (malicious) prv Φ circ OT, ZK proofs, commitment, trapdoor perm FAZ05 [19] private credit checking prv Φ size sym encryption FM06 [44] 2-party SFE (malicious) prv Φ circ OT, c”
Founding Cryptography on Oblivious Transfer - Efficiently (2008, unknown): “The case of two-party computation was recently resolved by Lindell and Pinkas [35] (see also [34, 36]), who presented a constant-round two-party protocol that makes a black-box use of (parallel) OT as well as a statistically hiding commitment.”
Secure Two-Party Computation is Practical (2009, background): “The construction of Mohassel and Franklin [23] only protects privacy and is not fully simulatable.”
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (2008, background): “As we have mentioned, we base our work on the protocol of [13], and we refer the reader to that work for a discussion of other approaches for providing security against malicious adversaries (e.g., [ 14 , 11, 23]).”
Secure Multiparty Computation (2011, unknown): “One mechanism that has been suggested to mitigate this attack is a cut-and-choose approach [22,24,25,29].”
Obliv-C: A Language for Extensible Data-Oblivious Computation (2015, methodology): “Another protocol we have implemented for Obliv-C is the dual execution variant of Yao’s protocol [21, 33].”
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer (2011, methodology): “The computational security parameter is the usual one that is used to model the security of the underlying computational assumptions (e.g., the DDH assumption).”