Secure two-party computation: Difference between revisions

Content deleted Content added
Markulf (talk | contribs)
No edit summary
m linked wikipedia article about Yao
Line 3:
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 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>.
 
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>.