Rafail Ostrovsky - Publications

On Complete Primitives for Fairness

Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostrovsky, Amit Sahai


For secure two-party and multi-party computation with abort, classification of which primitives are has been extensively studied in the literature. However, for fair secure computation, where (roughly speaking) either all parties learn the output or none do, the question of complete primitives has remained largely unstudied. In this work, we initiate a rigorous study of completeness for primitives that allow fair computation. We show the following results:

comment: Preliminary version in TCC 2010.

Fetch PostScript file of the paper     Fetch PDF file of the paper

Back to Publications List