Secure two-party computation: Difference between revisions

Revision as of 00:14, 8 May 2011

Revision as of 00:17, 8 May 2011

Line 1:

'''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>{{cite doi|10.1109/SFCS.1982.8838}}</ref> only provided security against passive adversaries. 2PC protocols that are secure against active adversaries were proposed by Lindell and Pinkas <ref>{{cite doi|10.1007/978-3-540-72540-4_4}}</ref>, Ishai, Prabhakaran and Sahai <ref>{{cite doi|10.1007/978-3-540-85174-5_32}}</ref> and Nielsen and Orlandi <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>{{cite doi|10.1007/978-3-540-72540-4_6}}</ref>.