New Monotones and Lower Bounds in Unconditional Two-Party Computation
Stefan Wolf, Jürg Wullschleger · IEEE Transactions on Information Theory · 2008
Since oblivious transfer, a primitive of paramount importance in secure two- and multiparty computation, cannot be realized in an unconditionally secure way for both parties from scratch, reductions to weak information-theoretic primitives as well as between different variants of the functionality are of great interest. In this context, various monotones-quantities that cannot be increased by any protocol-are introduced and then used to derive lower bounds on the possibility and efficiency of such reductions.