'''Secure two-party computation''' (2PC) is sub-problem of [[secure multi-party computation]] (MPC) that has received special attention by researchers because of its close relation to many [[cryptographic]] tasks. It is concerned with the question: 'Can two party computation be achieved more efficiently and under weaker security assumptions than general MPC?'
[[Andrew Yao|Yao]]'s protocol for two-party computation <ref>Andrew Chi-Chih Yao: Protocols for Secure Computations (Extended Abstract) FOCS{{cite doi|10.1109/SFCS.1982: 160-164.88}}</ref> only provided security against passive adversaries. 2PC protocols that are secure against active adversaries were proposed by Lindell and Pinkas <ref>Yehuda{{cite Lindell and Benny Pinkas: An Efficient Protocol for Secure Twodoi|10.1007/978-Party3-540-72540-4_4}}</ref>, ComputationIshai, inPrabhakaran theand PresenceSahai of<ref>{{cite Malicious Adversaries, EUROCRYPT 2007: 52-79 [http://wwwdoi|10.pinkas.net1007/malicious.pdf]978-3-540-85174-5_32}}</ref>,Ishai,and PrabhakaranNielsen and SahaiOrlandi <ref>{{cite doi|10.1007/978-3-642-00457-5_22}}</ref>.
Another solution for this problem, that explicitly works with committed input was proposed by Jarecki and Shmatikov <ref>S.{{cite Jarecki, Vdoi|10. Shmatikov. Efficient Two1007/978-Party Secure Computation on Committed Inputs. EUROCRYPT 2007 [http://www.cs.utexas.edu/~shmat/shmat_eurocrypt07.pdf]3-540-72540-4_6}}</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>.
