Secure two-party computation: Difference between revisions

Revision as of 13:09, 30 July 2009

Revision as of 13:17, 30 July 2009

Line 6:

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>.

==Security==

The security of a two-party computation protocol is usually defined through a comparison with an idealised scenario that is secure by definition. The idealised scenario involves a [[trusted party]] that collects the input of the two parties over [[secure channels]] and returns the result if non of the parties chooses to abort.

==References==