CSAIL Event Calendar: Previous Series
|
Complete Fairness in Secure Two-Party Computation Speaker: Jonathan Katz , University of Maryland 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.
See other events that are part of Cryptography and Information Security Seminars 2007/2008 |
