Complete Fairness in Secure Two-Party Computation
Speaker: Jonathan Katz , Univeristy of Maryland
Date: March 7 2008
Time: 10:30AM to 12:00PM
Location: Kiva-Patil
Host: Ran Canetti, IBM & MIT
Contact: Ran, 3-4632, Canetti
Relevant URL: http://groups.csail.mit.edu/cis/cis-talks.htmlAbstract:
A well known result of Cleve shows that completely-fair secure two-party computation is impossible. His result, however, only implies that complete fairness is impossible *in general*. In this work, we ask whether there are *any* interesting examples of functions that can be computed with complete fairness in the two-party setting, and give a partial answer to this question.
This is joint work with Carmit Hazay, Dov Gordon, and Yehuda Lindell
See other events that are part of Cryptography and Information Security Seminars 2007/2008
See other events happening in March 2008
