'''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>{{citeCite journal doi| last1 = Yao | first1 = A. C. | title = Protocols for secure computations | doi = 10.1109/SFCS.1982.38 | pages = 160–164 | year = 1982 | pmid = | pmc = }}</ref> only provided security against passive adversaries. 2PC protocols that are secure against active adversaries were proposed by Lindell and Pinkas,<ref>{{citeCite journal doi| last1 = Lindell | first1 = Y. | last2 = Pinkas | first2 = B. | doi = 10.1007/978-3-540-72540-4_4 | title = An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries | volume = 4515 | pages = 52–78 | year = 2007 | pmid = | pmc = }}</ref> Ishai, Prabhakaran and Sahai <ref>{{citeCite journal doi| last1 = Ishai | first1 = Y. | last2 = Prabhakaran | first2 = M. | last3 = Sahai | first3 = A. | title = Founding Cryptography on Oblivious Transfer – Efficiently | doi = 10.1007/978-3-540-85174-5_32 | volume = 5157 | pages = 572–591 | year = 2008 | pmid = | pmc = }}</ref> and Nielsen and Orlandi.<ref>{{citeCite book doi| last1 = Nielsen | first1 = J. B. | last2 = Orlandi | first2 = C. | doi = 10.1007/978-3-642-00457-5_22 | chapter = LEGO for Two-Party Secure Computation | title = Theory of Cryptography | series = Lecture Notes in Computer Science | volume = 5444 | pages = 368–386 | year = 2009 | isbn = 978-3-642-00456-8 | pmid = | pmc = }}</ref>
Another solution for this problem, that explicitly works with committed input was proposed by Jarecki and Shmatikov.<ref>{{citeCite journal doi| last1 = Jarecki | first1 = S. | last2 = Shmatikov | first2 = V. | doi = 10.1007/978-3-540-72540-4_6 | title = Efficient Two-Party Secure Computation on Committed Inputs | volume = 4515 | pages = 97–114 | year = 2007 | pmid = | pmc = }}</ref>
