Secure two-party computation: Difference between revisions

Revision as of 00:13, 17 September 2009

Revision as of 00:14, 17 September 2009

Line 4:

[[Andrew Yao | Yao]]'s protocol for two-party computation <ref>Andrew Chi-Chih Yao: Protocols for Secure Computations (Extended Abstract) FOCS 1982: 160-164</ref> only provided security against passive adversaries. 2PC protocols that are secure against active adversaries were proposed by Lindell and Pinkas <ref>Yehuda Lindell and Benny Pinkas: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries, EUROCRYPT 2007: 52-79 [http://www.pinkas.net/malicious.pdf]</ref>, Ishai, Prabhakaran and Sahai <ref>

Yuval Ishai, Manoj Prabhakaran, Amit Sahai: Founding Cryptography on Oblivious Transfer - Efficiently. CRYPTO 2008: 572-591</ref> and Nielsen and Orlandi <ref>Jesper Buus Nielsen, Claudio Orlandi: LEGO for Two-Party Secure Computation. TCC 2009: 368-386 [http://eprint.iacr.org/2008/427.pdf]</ref>.

Another solution for this problem, that explicitly works with committed input was proposed by Jarecki and Shmatikov <ref>S. Jarecki, V. Shmatikov. Efficient Two-Party Secure Computation on Committed Inputs. EUROCRYPT 2007 [http://www.cs.utexas.edu/~shmat/shmat_eurocrypt07.pdf]</ref>.